//2024.7.24
//by white_ice
//# 8815. Space Station
#include<bits/stdc++.h>
using namespace std;
#define itn long long 
#define int long long
constexpr int oo = 102;
constexpr int op = 10004;
constexpr int mod = 998244353;

itn ngm(itn a,itn b){return a<b?a:b;}

itn n,m;
itn c[oo],ic[oo];

__inline int qpow(itn a,itn b){int out=1;while(b){if(b&1)(out*=a)%=mod;b>>=1;(a*=a)%=mod;}return out;}

__inline void getc(itn n){
    0[c] = 1;for (itn i=1;i<=n;++i)i[c]=(i-1)[c]*i%mod;
    n[ic]=qpow(n[c],mod-2);
    for (itn i=n;i>=2;--i)(i-1)[ic]=i[c]*i%mod;
//    cout << n[c];
}

int f[oo][op];
int out;

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0),cout.tie(0);

    cin >> n >> m ;
    getc(n);
    f[0][0] = 1;
    for (itn x,i=1;i<=n;++i){
        cin >> x;
        for (int j=i;j>=1;--j){//01背包，倒序
            for (int k=0;k<=(j-1)*200;++k){
                (f[j][k+x] += f[j-1][k])%=mod;
            }
        }
    }
    for (int i=1;i<=n;++i){
        itn cur = 0;
        for (int j=1;j<=i*200;++j){
            (cur+=ngm(i*m,j)*f[i][j])%=mod;
        }
        (out+=cur*ic[n]%mod*c[i-1]%mod*c[n-i]%mod)%=mod;
    }
    
    cout << out;
    return 0;
}