#include <bits/stdc++.h>
using namespace std;
using ll=long long;

ll MAX=1000000; 
ll MOD=998244353;
vector<ll> fac(MAX,0),finv(MAX,0),inv(MAX,0);
// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}
ll COM(int n, int k){
    if (n < k) return 0;
    if (n < 0 || k < 0) return 0;
    return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int main(){
    COMinit();
    ll mod=998244353;
    int N,M;
    cin>>N>>M;
    vector<int> A(N);
    for(int i=0;i<N;i++){
        cin>>A[i];
    }
    vector<int> dp(M+10,M+10);
    dp[0]=0;
    for(int i=0;i<N;i++){
        for(int j=0;j<=M;j++){
            if(j+A[i]>M) break;
            dp[j+A[i]]=min(dp[j+A[i]],dp[j]+1);
        }
    }
    ll ans=0;
    for(int i=0;i<=M;i++){
        ans+=COM(M-dp[i],i-dp[i]);
    }
    ans=(ans+10*mod)%mod;
    cout<<ans<<endl;
    return 0;
}