#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, m, a[100005], sum[100005], f[1005][1005], ssum[1000006];
const int mod = 998244353;
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= n; i++) {
		sum[i] = sum[i - 1] + a[i];
	}
	if (m >= sum[n]) {
		cout << 1;
		return 0;
	}
	int ans = 0;
	ssum[sum[n]] = 1;
	for (int i = n; i >= 1; i--) {
		for (int j = 0; j <= m; j++) {
			f[i][j] = (ssum[sum[i] - j + m ] + mod) % mod;
		}
		for (int j = sum[i - 1]; j <= min(m, sum[i] - 1); j++) {
			ans += f[i][j];
			ans %= mod;
		}
		if (!(n - i)) {
			f[n][m] = 1;
		}
		for (int j = 0; j <= m; j++) {
			ssum[sum[i - 1] - j + m] += f[i][j];
			ssum[sum[i - 1] - j + m] %= mod;
		}
	}
	cout << ans;
}