MOD = 998244353
N = 100100
fact = [0 for _ in range(N)]
invfact = [0 for _ in range(N)]
fact[0] = 1
for i in range(1, N):
    fact[i] = fact[i - 1] * i % MOD

invfact[N - 1] = pow(fact[N - 1], MOD - 2, MOD)

for i in range(N - 2, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % MOD

def nCk(n, k):
    if k < 0 or n < k:
        return 0
    else:
        return (fact[n] * invfact[k] % MOD) * invfact[n - k] % MOD

def nHk(n, k):
    return nCk(n + k - 1, k)
n, m = map(int, input().split())
A = list(map(int, input().split()))
inf = 1 << 30
dp = [inf] * (m + 1)
dp[0] = 0
for a in A:
    for i in range(a, m + 1):
        dp[i] = min(dp[i], dp[i - a] + 1)

ans = 0
for i in range(m + 1):
    if dp[i] == inf:
        continue
    ans += nCk(m - dp[i], i - dp[i])
    ans %= MOD
print(ans)