import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
sys.setrecursionlimit(10**7)
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
p = 998244353
N = 2*10**5  # N は必要分だけ用意する
fact = [1, 1]  # fact[n] = (n! mod p)
factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1]  # factinv 計算用

for i in range(2, N + 1):
    fact.append((fact[-1] * i) % p)
    inv.append((-inv[p % i] * (p // i)) % p)
    factinv.append((factinv[-1] * inv[-1]) % p)
def cmb(n, r):
    if (r < 0) or (n < r):
        return 0
    r = min(r, n - r)
    return ((fact[n] * factinv[r])%p) * factinv[n-r] % p

def pem(n,r):
    if (r < 0) or (n < r):
        return 0
    return (fact[n] * factinv[r])%p
n,m = na()
inf = 10**9
dp = [inf]*(m+1)
a = na()
dp[0] = 0
for i in range(n):
    for j in range(m+1):
        if j+a[i]<=m:
            dp[j+a[i]] = min(dp[j+a[i]],dp[j]+1)
ans = 0
for i in range(m+1):
    if dp[i]==inf:
        continue
    z = dp[i]
    #print(m,z,i)
    ans+=cmb(m-z,i-z)
    ans%=p
#print(ans)
print(ans)