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

mod = 998244353
n = 10**5+5
fact = [1] * (n + 1)
invfact = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
invfact[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % mod

def comb(n, r):
    if n < 0 or r < 0 or n - r < 0:
        return 0
    return fact[n] * invfact[r] * invfact[n - r] % mod


dist = [-1] * (M + 1)
from collections import *
Q = deque()
Q.append(0)
dist[0] = 0
while Q:
    u = Q.popleft()
    for a in A:
        v = u + a
        if v > M:
            continue
        if dist[v] <= dist[u] + 1 and dist[v] != -1:
            continue
        dist[v] = dist[u] + 1
        Q.append(v)
        
ans = 0
for i in range(M + 1):
    if dist[i] == -1:
        continue
    ans += comb(M - dist[i], i - dist[i])
    ans %= mod
    
print(ans)