Problem: 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

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define grep(i,u) for (int i = head[u],v = e[i].v; i; v = e[i = e[i].nxt].v)
#define il inline
#define LL long long
#define ULL unsigned LL
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<LL,LL>
#define fi first
#define se second
using namespace std;
il LL read() {
	LL res = 0,f = 1; char ch = getchar(); while (!isdigit(ch)) {if (ch == '-') f = -f; ch = getchar();}
	while (isdigit(ch)) {res = res*10+ch-'0'; ch = getchar();} return res*f;
}
namespace qiqi {
	const int N = 10,C = 55,S = 1<<N; int n,c,l[N],f[N*C][S];
	void main() {
		int x,cnt = 0; LL ans = 0; n = read(); c = read(); rep(i,0,n-1) l[i] = read(); sort(l,l+n);
		while (1) {
			memset(f,0,sizeof(f)); f[l[n-1]*n][0] = 1;
			rep(i,1,c*n) if ((x = i%n-1) >= 0) rep(j,i,c*n) rep(s,0,(1<<(n-1))-1) if (!((s>>x)&1)) f[min(c*n,max(j,i+l[x]*n))][s|(1<<x)] += f[j][s];
			ans += f[c*n][(1<<(n-1))-1]; ++cnt; if (!next_permutation(l,l+n-1)) break;
		}
		printf("%.13lf\n",1.0*ans/cnt/pow(c,n-1));
	}
}
int main() {
	qiqi::main(); return 0;
}