#include <stdio.h>

const int Mod = 998244353;
long long fact[100001], fact_inv[100001];

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long combination(int n, int k)
{
	if (k < 0 || n < k) return 0;
	return fact[n] * fact_inv[k] % Mod * fact_inv[n-k] % Mod;
}


int main()
{
	int i, N, M, A[101];
	scanf("%d %d", &N, &M);
	for (i = 1; i <= N; i++) scanf("%d", &(A[i]));
	for (i = 1, fact[0] = 1; i <= M; i++) fact[i] = fact[i-1] * i % Mod;
	for (i = M - 1, fact_inv[M] = div_mod(1, fact[M], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;

	int j, dist[100001], q[100001], head, tail;
	long long ans = 0;
	for (i = 1, dist[0] = 0; i <= M; i++) dist[i] = -1;
	q[0] = 0;
	for (head = 0, tail = 1; head < tail; head++) {
		i = q[head];
		ans += combination(M - dist[i], i - dist[i]);
		for (j = 1; j <= N; j++) {
			if (i + A[j] <= M && dist[i + A[j]] < 0) {
				dist[i + A[j]] = dist[i] + 1;
				q[tail++] = i + A[j];
			}
		}
	}
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}