import sys
input = sys.stdin.readline
from collections import *

MAX = 10**5+100
MOD = 998244353
fact = [0]*MAX #fact[i]: i!
inv = [0]*MAX #inv[i]: iの逆元
finv = [0]*MAX #finv[i]: i!の逆元
fact[0] = 1
fact[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
    
for i in range(2, MAX):
    fact[i] = fact[i-1]*i%MOD
    inv[i] = MOD-inv[MOD%i]*(MOD//i)%MOD
    finv[i] = finv[i-1]*inv[i]%MOD

def C(n, r):
    if n<r:
        return 0
    if n<0 or r<0:
        return 0
    return fact[n]*(finv[r]*finv[n-r]%MOD)%MOD

N, M = map(int, input().split())
A = list(map(int, input().split()))
dp = [10**18]*(M+1)
dp[0] = 0

for i in range(M+1):
    for Ai in A:
        if i+Ai<=M:
            dp[i+Ai] = min(dp[i+Ai], dp[i]+1)

ans = 0

for i in range(M+1):
    ans += C(M-dp[i], i-dp[i])
    ans %= MOD

print(ans)