class DualSegmentTree:
    def __init__(self, n, segfunc, ide_ele):
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num

    def update(self,l,r,x):
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                self.tree[l] = self.segfunc(self.tree[l],x)
                l += 1
            if r & 1:
                self.tree[r-1] = self.segfunc(self.tree[r-1],x)
            l >>= 1
            r >>= 1

    def __getitem__(self,idx):
        idx += self.num
        res = self.ide_ele
        while idx:
            res = self.segfunc(res,self.tree[idx])
            idx>>=1
        return res

import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

mod = 1234567891

N,M = mi()
A = li()

dp = {0:1}
for k in range(60):
    t = 2**k
    for j in range(N):
        ndp = {s:dp[s] for s in dp}
        for s in dp:
            if s+A[j]*t > M:
                continue
            if s+A[j]*t not in ndp:
                ndp[s+A[j]*t] = 0
            ndp[s+A[j]*t] += dp[s]
            ndp[s+A[j]*t] %= mod
        dp = ndp
    dp = {s:dp[s] for s in dp if s%(2*t)==M%(2*t)}

if M in dp:
    print(dp[M])
else:
    print(0)