Problem: Nezzar buys his favorite snack — n chocolate bars with lengths l_1,l_2,…,l_n. However, chocolate bars might be too long to store them properly! 

In order to solve this problem, Nezzar designs an interesting process to divide them into small pieces. Firstly, Nezzar puts all his chocolate bars into a black box. Then, he will perform the following operation repeatedly until the maximum length over all chocolate bars does not exceed k.

  * Nezzar picks a chocolate bar from the box with probability proportional to its length x. 
  * After step 1, Nezzar uniformly picks a real number r ∈ (0,x) and divides the chosen chocolate bar into two chocolate bars with lengths r and x-r. 
  * Lastly, he puts those two new chocolate bars into the black box. 



Nezzar now wonders, what is the expected number of operations he will perform to divide his chocolate bars into small pieces.

It can be shown that the answer can be represented as P/Q, where P and Q are coprime integers and Q not ≡ 0 (mod 998 244 353). Print the value of P⋅ Q^{-1} mod 998 244 353.

Input

The first line contains two integers n and k (1 ≤ n ≤ 50, 1 ≤ k ≤ 2000).

The second line contains n integers l_1, l_2, …, l_n (1 ≤ l_i, ∑_{i=1}^{n} l_i ≤ 2000).

Output

Print a single integer — the expected number of operations Nezzar will perform to divide his chocolate bars into small pieces modulo 998 244 353.

Examples

Input


1 1
2


Output


4


Input


1 1
1


Output


0


Input


1 5
1234


Output


15630811


Input


2 1
2 3


Output


476014684


Input


10 33
10 20 30 40 50 60 70 80 90 100


Output


675105648

Solution (in CPP):

Solution:
#include <cstdio>
int quick_power(int a,int b,int Mod){
	int ans=1;
	while(b){
		if(b&1){
			ans=1ll*ans*a%Mod;
		}
		b>>=1;
		a=1ll*a*a%Mod;
	}
	return ans;
}
const int Mod=998244353;
const int Maxn=50;
const int Maxk=2000;
int find_inv(int x){
	return quick_power(x,Mod-2,Mod);
}
int fac[Maxk+5],inv_f[Maxk+5];
void init(){
	fac[0]=1;
	for(int i=1;i<=Maxk;i++){
		fac[i]=1ll*fac[i-1]*i%Mod;
	}
	inv_f[Maxk]=find_inv(fac[Maxk]);
	for(int i=Maxk-1;i>=0;i--){
		inv_f[i]=1ll*inv_f[i+1]*(i+1)%Mod;
	}
}
int n,k;
int a[Maxn+5];
int sum_len,inv_sum;
int f[Maxn+5][Maxk+5][Maxn+5];
int find_val(int a,int b){
	return 1ll*fac[a]*find_inv(quick_power(1-b,a+1,Mod))%Mod;
}
int main(){
	init();
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		sum_len+=a[i];
	}
	inv_sum=find_inv(sum_len);
	f[0][0][0]=1;
	int s_k=0;
	for(int i=1;i<=n;i++){
		for(int j=0;j<=(a[i]-1)/k;j++){
			int p=1ll*((j&1)?-1:1)*inv_f[j]*quick_power(1ll*(a[i]-j*k)*inv_sum%Mod,j,Mod)%Mod;
			for(int l=0;l<=s_k;l++){
				for(int t=0;t<i;t++){
					if(f[i-1][l][t]==0){
						continue;
					}
					f[i][l+j][t]=(f[i][l+j][t]+1ll*f[i-1][l][t]*p)%Mod;
				}
			}
			if(j>0){
				p=1ll*((j&1)?-1:1)*inv_f[j-1]*quick_power(1ll*(a[i]-j*k)*inv_sum%Mod,j-1,Mod)%Mod;
				for(int l=0;l<=s_k;l++){
					for(int t=0;t<i;t++){
						if(f[i-1][l][t]==0){
							continue;
						}
						f[i][l+j][t+1]=(f[i][l+j][t+1]+1ll*f[i-1][l][t]*p)%Mod;
					}
				}
			}
		}
		s_k+=(a[i]-1)/k;
	}
	for(int i=0;i<=s_k;i++){
		for(int j=0;j<=n;j++){
			f[n][i][j]=-f[n][i][j];
		}
	}
	int ans=0;
	for(int i=0;i<=s_k;i++){
		for(int j=0;j<=n&&j<=i;j++){
			ans=(ans+1ll*f[n][i][j]*find_val(i-j,1ll*(sum_len-i*k)*inv_sum%Mod))%Mod;
		}
	}
	ans=(ans%Mod+Mod)%Mod;
	printf("%d\n",ans);
	return 0;
}