#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;

const ll MOD = 998244353;
const int INF = 10000000;

long long modpow(long long x, long long n){
    long long  res = 1;
    long long mul = x;
    while(n){
        if(n % 2) res = res * mul % MOD;
        mul = mul * mul % MOD;
        n /= 2;
    }
    return res;
}

struct Combination
{
    int maxn;
    std::vector<long long> fact;
    std::vector<long long> ifact;
    
    Combination(int maxn) : maxn(maxn){
        fact.resize(maxn + 1);
        ifact.resize(maxn + 1);
        fact[0] = 1;
        for(int i = 1; i <= maxn; i++) fact[i] = fact[i - 1] * i % MOD;
        ifact[maxn] = modpow(fact[maxn], MOD - 2);
        for(int i = maxn - 1; i >= 0; i--) ifact[i] = ifact[i + 1] * (i + 1) % MOD;
    }

    long long com(int n, int k){
        if(k > n || k < 0) return 0;
        if(k == n || k == 0) return 1;
        return (fact[n] * ifact[k] % MOD) * ifact[n - k] % MOD;
    }
};

int main()
{
	int n, m;
	cin >> n >> m;
	int a[102];
	for(int i = 0; i < n; i++) cin >> a[i];
	int dp[100005];
	dp[0] = 0;
	for(int i = 1; i <= m; i++) dp[i] = INF;
	for(int i = 0; i < n; i++){
		int d[100005];
		for(int j = 0; j <= m; j++) d[j] = dp[j];
		for(int j = a[i]; j <= m; j++) d[j] = min(d[j], d[j - a[i]] + 1);
		swap(dp, d);
	}
	ll ans = 0;
	Combination com(m);
	for(int i = 0; i <= m; i++){
		ans = (ans + com.com(m - dp[i], i - dp[i])) % MOD;
	}
	cout << ans << endl;
}