mod = 998244353

class Combinatorics:
	def __init__(self, n: int) -> None:
		self.n = n
		self.fa = [1] * (self.n * 2 + 1)
		self.fi = [1] * (self.n * 2 + 1)

		for i in range(1, self.n * 2 + 1):
			self.fa[i] = self.fa[i - 1] * i % mod

		self.fi[-1] = pow(self.fa[-1], mod - 2, mod)

		for i in range(self.n * 2, 0, -1):
			self.fi[i - 1] = self.fi[i] * i % mod

	def comb(self, n: int, r: int) -> int:
		if n < r:return 0
		if n < 0 or r < 0:return 0
		return self.fa[n] * self.fi[r] % mod * self.fi[n - r] % mod

	def perm(self, n: int, r: int) -> int:
		if n < r:return 0
		if n < 0 or r < 0:return 0
		return self.fa[n] * self.fi[n - r] % mod
		
	def combr(self, n: int, r: int) -> int:
		if n == r == 0:return 1
		return self.comb(n + r - 1, r)
INF = 10 ** 18
n, m = map(int, input().split())
a = list(map(int, input().split()))
dp = [INF] * (m + 1)
dp[0] = 0
for i in range(m):
	for j in range(n):
		if i + a[j] <= m:
			dp[i + a[j]] = min(dp[i + a[j]], dp[i] + 1)
C = Combinatorics(m)
ans = 0
for i in range(m + 1):
	if dp[i] != INF: ans += C.comb(m - dp[i], i - dp[i]); ans %= mod
print(ans)