#include <cstdio>
#include <algorithm>

using i64 = long long;

const int N = 105;
const int mod = 998244353;

int n, m;
int a[N], mx;

i64 qpow(i64 a, i64 b = mod - 2) {
	i64 ans = 1;
	for (; b; b >>= 1, a = a * a % mod) {
		if (b & 1) {
			ans = ans * a % mod;
		}
	}
	return ans;
}

i64 fac[N], inv[N];
void prework() {
	fac[0] = inv[0] = inv[1] = 1;
	for (int i = 1; i <= n; i++) {
		fac[i] = fac[i - 1] * i % mod;
	}

	for (int i = 2; i <= n; i++) {
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
	}
	
	for (int i = 1; i <= n; i++) {
		inv[i] = inv[i] * inv[i - 1] % mod;
	}
}

i64 invC(int x, int y) {
	return inv[x] * fac[y] % mod * fac[x - y] % mod;
}

i64 f[N][N * N * 2];

int main() {
	scanf("%d %d", &n, &m);

	for (int i = 1; i <= n; i++) {
		scanf("%d", a + i);
		mx += a[i];
	}

	prework();

	f[0][0] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = n; j >= 1; j--) {
			for (int k = a[i]; k <= mx; k++) {
				f[j][k] = (f[j][k] + f[j - 1][k - a[i]]) % mod;
			}
		}
	}

	i64 ans = 0;	
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= mx; j++) {
			ans = (ans + invC(n, i) * f[i][j] % mod * std::min(j, i * m) * qpow(i) % mod) % mod;
		}
	}

	printf("%lld", ans);
	return 0;
}