N, M = map(int, input().split())
A = list(map(int, input().split()))

class Ncrs():
    def __init__(self, max_r, mod = 998244353) -> None:
        self.mod = mod
        self.fct, self.inv = [1] * (max_r+2), [1]* (max_r+2)
        for i in range(2, max_r+1):
            self.fct[i] = self.fct[i-1] * i % mod
            self.inv[max_r] = pow(self.fct[max_r], mod-2, mod)
        for i in range(max_r, 0,-1):
            self.inv[i-1] = self.inv[i] * i % mod
    def __call__(self, n, k) -> int:
        return self.nck(n, k)
    def nck(self, n, k) -> int:
        if k > n or n <0 or k <0:
            return 0
        return self.fct[n] * self.inv[k] % self.mod * self.inv[n-k] % self.mod

ncr = Ncrs(10**5)
dp = [[float('inf')]*(M+1) for _ in range(N+1)]
dp[0][0] = 0
for i in range(N):
    for j in range(M+1):
        if j < A[i]:
            dp[i+1][j] = min(dp[i+1][j], dp[i][j])
        else:
            dp[i+1][j] = min(dp[i][j], dp[i+1][j-A[i]]+1)
res = 1
for i in range(1, M+1):
    res += ncr(M-dp[-1][i], i-dp[-1][i])
    res %= 998244353
print(res)