You have a circle of length C, and you are placing N arcs on it. Arc i has length L_i.

Every arc i is placed on the circle uniformly at random: a random real point on the circle is chosen, then an arc of length L_i centered at this point appears.

Note that the arcs are placed independently. For example, they may intersect or contain each other.

What is the probability that every real point of the circle will be covered by at least one arc? Assume that an arc covers its ends.

Constraints

* 2 \leq N \leq 6
* 2 \leq C \leq 50
* 1 \leq L_i < C
* All input values are integers.

Input

Input is given from Standard Input in the following format:


N C
L_1 L_2 ... L_N


Output

Print the probability that every real point of the circle will be covered by at least one arc. Your answer will be considered correct if its absolute error doesn't exceed 10^{-11}.

Examples

Input

2 3
2 2


Output

0.3333333333333333


Input

4 10
1 2 3 4


Output

0.0000000000000000


Input

4 2
1 1 1 1


Output

0.5000000000000000


Input

3 5
2 2 4


Output

0.4000000000000000


Input

4 6
4 1 3 2


Output

0.3148148148148148


Input

6 49
22 13 27 8 2 19


Output

0.2832340720702695
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
#define mp make_pair
#define PI pair<int,int>
#define poly vector<int>
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
#define pb push_back
#define mem(a) memset((a),0,sizeof(a))
#define fi first
#define se second
inline char gc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline ll read(){
	ll x = 0; char ch = gc(); bool positive = 1;
	for (; !isdigit(ch); ch = gc())	if (ch == '-')	positive = 0;
	for (; isdigit(ch); ch = gc())	x = x * 10 + ch - '0';
	return positive ? x : -x;
}
inline void write(ll a){
    if(a<0){
    	a=-a; putchar('-');
	}
    if(a>=10)write(a/10);
    putchar('0'+a%10);
}
inline void writeln(ll a){write(a); puts("");}
inline void wri(ll a){write(a); putchar(' ');}
const int N=7,M=1<<5|2,C=50;
ld f[M][N*C],g[M][N*C],h[N][M][N*C];
int l[N],s[M];
int main(){
	int n=read(),C=read();
	For(i,0,n-1)l[i]=read();
	sort(l,l+n); n--;
	f[0][l[n]*(n+1)]=1;
	For(i,1,(1<<n)-1)s[i]=s[i>>1]+(i&1);
	For(i,0,C-1){
		mem(h);
		For(j,0,(1<<n)-1){
			For(k,0,C*(n+1)){
				g[j][k]=f[j][k];
				h[k%(n+1)][j][k]=k/(n+1)==i?f[j][k]:0;
			}
		}
		For(j,0,n-1){
			Rep(zt,(1<<n)-1,0)if((zt>>j&1)==0){
				For(k,0,C*(n+1)){
					int P=k%(n+1),nm=(i+l[j])*(n+1);
					For(q,1,s[zt]+1){
						nm++;
						int jj=min(max(k+(q<=P&&zt),nm),C*(n+1));
						//if(i==0)cout<<k+(q<=P&&s[zt])<<" "<<nm<<" "<<g[zt][k]<<endl;
						g[zt|(1<<j)][jj]+=g[zt][k];
						For(p0,0,q-1){
							h[p0][zt|(1<<j)][jj]+=h[p0][zt][k];
						}
					}
				}
			}
		}
		For(j,0,(1<<n)-1){
			For(k,0,C*(n+1)){
				f[j][k]=g[j][k];
				For(p0,0,s[j]+1){
					f[j][k]-=h[p0][j][k];
				}
			}
		}
		//if(i==2)cout<<f[(1<<n)-1][6]<<" "<<h[2][0][2]<<endl;
	}
	ld ans=f[(1<<n)-1][C*(n+1)]/pow(C,n);
	For(i,1,n)ans/=i;
	printf("%.12f\n",ans);
}