# include <bits/stdc++.h>
# define mod 998244353
# define int long long
# define rep(i, j, k) for(int i = j; i <= k; ++i)
using namespace std;

int n, m, ans, c;
int a[105], preSum[105], fac[105], inv1, inv[105];
int dp[2][105][100 * 200 + 5];

inline int qp(int a, int b) {int mul = 1; while(b) {if(b & 1) mul = mul * a % mod; a = a * a % mod, b >>= 1;} return mul;}

signed main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m; rep(i, 1, n) cin >> a[i], preSum[i] = preSum[i - 1] + a[i];
    dp[0][0][0] = fac[0] = 1;
    rep(i, 1, n) fac[i] = fac[i - 1] * i % mod; inv1 = qp(fac[n], mod - 2);
    rep(i, 1, n) inv[i] = qp(i, mod - 2);
    rep(i, 1, n) rep(j, 0, i) rep(k, 0, 200 * j)
        if(j && k >= a[i]) dp[i & 1][j][k] = (dp[(i & 1) ^ 1][j][k] + dp[(i & 1) ^ 1][j - 1][k - a[i]]) % mod;
        else dp[i & 1][j][k] = dp[(i & 1) ^ 1][j][k];
    rep(j, 1, n) rep(k, 1, preSum[n]) {
        if(!dp[n & 1][j][k]) continue;
        if(j * m >= k) c = k * inv[j] % mod;
        else c = m;
        ans = (ans + dp[n & 1][j][k] * fac[j] * fac[n - j] % mod * c % mod * inv1) % mod;
    }
    cout << ans << '\n';
    return 0;
}