#include <bits/stdc++.h>
using namespace std;
int read() {
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9') {if (c == '-') f = -f; c = getchar();}
    while (c >= '0' && c <= '9') {x = x * 10 + (c ^ 48); c = getchar();}
    return x * f;
}
int quickpow(int a, int b, int mod) {
    int res = 1;
    for (; b; b >>= 1, a = 1LL * a * a % mod)
        if (b & 1) res = 1LL * res * a % mod;
    return res;
}
const int N = 105, mod = 998244353;
int f[N][N * N], a[N], fac[N], Inv[N], inv[N * N];
int n, m, V = 100, ans;
int C(int a, int b) {
    if (a < 0 || b < 0 || a < b) return 0;
    return 1LL * fac[a] * Inv[b] % mod * Inv[a - b] % mod;
}
void add(int &x, int y) {
    x += y;
    if (x >= mod) x -= mod;
}
void Solve() {
    n = read(); m = read(); fac[0] = 1;
    for (int i = 1; i <= n; i++) fac[i] = 1LL * fac[i - 1] * i % mod;
    Inv[n] = quickpow(fac[n], mod - 2, mod);
    for (int i = n - 1; ~i; i--) Inv[i] = 1LL * Inv[i + 1] * (i + 1) % mod;
    for (int i = 1; i <= n * V; i++) inv[i] = quickpow(i, mod - 2, mod);
    for (int i = 1; i <= n; i++) a[i] = read();
    f[0][0] = 1;
    for (int i = 1; i <= n; i++) for (int j = i; j; j--)
        for (int k = a[i]; k <= i * V; k++) add(f[j][k], f[j - 1][k - a[i]]);
    for (int i = 1; i <= n; i++) {
        int p = quickpow(C(n, i), mod - 2, mod), t;
        for (int j = 0; j <= n * V; j++) {
            if (j <= i * m) t = 1LL * j * inv[i] % mod; else t = m;
            ans = (ans + 1LL * p * f[i][j] % mod * t) % mod;
        }
    }
    printf("%d\n", ans);
}
int main() {
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    int _ = 1;
    while (_--) Solve();
    return 0;
}