#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long double db;
typedef long long ll;

const ll N = 2e2 + 10;
const ll M = 4e4 + 10;
const ll mod = 998244353;
const ll inf32 = 0x3f3f3f3f;
const ll inf64 = 5e18;

int fac[N];
int invFac[N];
int dp[N][M];

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;
}

ll qmi(ll a, ll b){
    ll res = 1;
    while (b){
        if (b & 1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

ll inv(ll x) {return qmi(x, mod - 2);}

void init() {
    fac[0] = 1;
    for (int i = 1; i <= 100; i++) {
        fac[i] = (ll)i * fac[i - 1] % mod;
    }
    invFac[100] = inv(fac[100]);
    for (int i = 100; i > 0; i--) {
        // cout << i << ' ' << invFac[i] << endl;
        invFac[i - 1] = (ll)i * invFac[i] % mod;
    }
}

void solve(){
    int n, m;
    cin >> n >> m;
    vector<int> a(n + 1);
    int mx = 0;
    for (int i = 1; i <= n; ++i)
        cin >> a[i], mx = max(a[i], mx);
    dp[0][0] = 1;
    for (int i = 1; i <= n; ++i)
        for (int j = i; j >= 1; --j)
            for (int l = 0; l <= (j - 1) * mx; ++l){
                int r = l + a[i];
                dp[j][r] = (dp[j][r] + dp[j - 1][l]) % mod;
            }
    ll sum = 0;
    for (int c = 1; c <= n; ++c){
        ll cur = 0;
        for (int s = 1; s <= c * mx; ++s)
            cur = (cur + ll(min(s, c * m) * dp[c][s])) % mod;
        sum = (sum + cur * InvCn(n, c)) % mod;
    }
    cout << sum << endl;
}

signed main(){
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    init();
    int t = 1;
    //cin >> t;
    while(t--) solve();
    return 0;
}