#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
#include <fstream>
using namespace std;
long long fac[200020], finv[200020], inv[200020];
long long mod = 998244353;
void COMinit() {
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for (int i = 2; i < 200020; 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(long long n, long long k) {
	if (n < k) return 0;
	if (n < 0 || k < 0) return 0;
	return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int a[110];
int dp[100010];
int main() {
	COMinit();
	int n, m;
	cin >> n >> m;
	dp[0] = 0;
	for (int i = 1; i <= m; i++) {
		dp[i] = 1000000007;
	}
	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		for (int j = 0; j <= m - a; j++) {
			dp[j + a] = min(dp[j] + 1, dp[j + a]);
		}
	}
	long long ans = 0;
	for (int i = 0; i <= m; i++) {
		if (dp[i] != 1000000007) {
			ans += COM(m - dp[i], i - dp[i]);
			ans %= mod;
		}
	}
	cout << ans << endl;
}