MOD = 1234567891

def multiply(A, B):
    n = len(A)
    m = len(B)
    C = [0] * (n + m - 1)
    for i, a in enumerate(A):
        for j, b in enumerate(B):
            C[i + j] += a * b
            C[i + j] %= MOD
    return C

# [x ^ n] P(x) / Q(x)
def BostanMori(P, Q, n):    
    while n:
        R = [(x * (-1) ** (i % 2)) % MOD for i, x in enumerate(Q)]
        Q = multiply(Q, R)[::2]
        P = multiply(P, R)[n % 2::2]
        n >>= 1
    return P[0] * pow(Q[0], MOD - 2, MOD) % MOD

n, m = map(int, input().split())
A = list(map(int, input().split()))
tot = sum(A)
dp = [0] * (tot + 1)
dp[0] = 1
for a in A:
    for i in range(tot, a - 1, -1):
        dp[i] -= dp[i - a]
        dp[i] %= MOD

ans = BostanMori([1], dp, m)
print(ans)