#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MAXN=200+5;
const int mod=998244353;
inline int ksm(int a, int b){
	int cnt = 1;
	while(b) {
		if(b & 1) cnt = cnt * a % mod;
		a = a * a % mod; b >>= 1;
	}return cnt;
}
int n,m,a[MAXN];
int dp[MAXN][MAXN];
int fac[MAXN],inv[MAXN];
signed main(){
	cin.tie(0),cout.tie(0);
	ios::sync_with_stdio(0);
	cin>>n>>m;int all = 0;
	for(int i = 1; i <= n; i++)cin >> a[i], all += a[i];
	fac[0] = 1;
	for(int i = 1; i <= n; i++)
		fac[i] = fac[i - 1] * i % mod;
	inv[n] = ksm(fac[n], mod - 2);
	for(int i = n - 1; i >= 0; i--)
		inv[i] = inv[i + 1] * (i + 1) % mod;
	function <int(int, int)> C = [&](int a, int b) -> int{return fac[a] * inv[b] % mod * inv[a - b] % mod;};
	dp[0][0] = 1;
	for(int i = 1; i <= n; i++)
		for(int j = i; j >= 1; j--)
			for(int k = all; k >= a[i]; k--)
				(dp[j][k] += dp[j - 1][k - a[i]]) %= mod;
	int ans = 0;
	for(int i = 1; i <= n; i++){
		int sum = 0;
		for(int j = 1; j <= all; j++){
			if(i * m > j)(sum += dp[i][j] * j % mod * ksm(i, mod - 2) % mod) %= mod;
			else (sum += dp[i][j] * m % mod) %= mod;
		}
		(ans += sum * ksm( C(n, i), mod - 2) % mod) %= mod;
	}
	cout << ans << "\n";
}