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

constexpr int mod = 998244353;

long long fac[200005], finv[200005], inv[200005];

void COMinit() {
    fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
    for (int i = 2; i < 200005; 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;
    }
}

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

long long dp[100005];
int inf = 1001001001;

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