#include <iostream>

#define ll long long

const int MOD = 998244353;

using namespace std;

template<class T>
ll Pow(ll a, T b) {
    ll res = 1;
    while (b) {
        if (b & 1) {
            res = res * a % MOD;
        }
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

ll Inv(ll a) {
    return Pow(a, MOD - 2);
}

int Add(int a, int b) {
    int res = a + b;
    if (res < MOD) {
        return res;
    }
    return res - MOD;
}

int n;
int m;
int cnt[101][10001];

int fac[101];
int invFac[101];

ll C(int a, int b) {
    return (ll)fac[a] * invFac[a - b] % MOD * invFac[b] % MOD;
}

ll InvCn(int a, int b) {
    return (ll)invFac[a] * fac[a - b] % MOD * fac[b - 1] % MOD;
}

void Init() {
    fac[0] = 1;
    for (int i = 1; i <= n; i++) {
        fac[i] = (ll)i * fac[i - 1] % MOD;
        // cout << i << ' ' << fac[i] << endl;
    }
    invFac[n] = Inv(fac[n]);
    for (int i = n; i > 0; i--) {
        // cout << i << ' ' << invFac[i] << endl;
        invFac[i - 1] = (ll)i * invFac[i] % MOD;
    }
}

void Solve() {
    cin >> n >> m;
    Init();
    cnt[0][0] = 1;
    for (int i = 1; i <= n; i++) {
        int a;
        cin >> a;
        for (int j = i; j > 0; j--) {
            for (int l = 0; l <= (j - 1) * m; l++) {
                int r = min(l + a, j * m);
                cnt[j][r] = Add(cnt[j][r], cnt[j - 1][l]);
            }
        }
    }
    // cout << cnt[1][2] << endl;
    ll res = 0;
    for (int i = 1; i <= n; i++) {
        ll cur = 0;
        for (int j = 1; j <= i * m; j++) {
            cur = (cur + (ll)j * cnt[i][j]) % MOD;
        }
        // cout << i << ' ' << cur << endl;
        // cout << C(n, i) << endl;
        res = (res + cur * InvCn(n, i)) % MOD;
    }
    cout << res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    Solve();
    return 0;
}