#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=101,M=998244353;
int n,m,s[N],a[N],jc[N],inv[N],dp[N][N][N*200];

int ksm(int a,int b=M-2){int ans=1;while(b){if(b&1) ans=ans*a%M;b>>=1,a=a*a%M;}return ans;}

void init(){
	jc[0]=jc[1]=inv[0]=inv[1]=1;
	for(int i=2;i<N;i++)
		jc[i]=jc[i-1]*i%M,
		inv[i]=ksm(jc[i]);
}

int iC(int n,int m){return inv[n]*jc[m]%M*jc[n-m]%M;}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin>>n>>m;
	init();
	for(int i=1;i<=n;i++) cin>>a[i],s[i]+=a[i];
	dp[0][0][0]=1;
	for(int i=1;i<=n;i++)
		for(int j=0;j<=i;j++)
			for(int k=0;k<=s[i];k++){
				dp[i][j][k]=dp[i-1][j][k];
				if(j&&k>=a[i]) dp[i][j][k]=(dp[i][j][k]+dp[i-1][j-1][k-a[i]])%M;
			}
	int ans=0;
	for(int i=1;i<=n;i++)
		for(int j=0;j<=s[i];j++)
			ans=(ans+dp[n][i][j]*iC(n,i)%M*min(m*i,j)%M*ksm(i)%M)%M;
	cout<<ans;
	return 0;
}