#include <bits/stdc++.h>
#pragma GCC optimize(2)
//#define endl '\n'
#define ll long long //unsigned long long
#define pb push_back
#define mem(a,x) memset(a,x,sizeof(a))
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define pi acos(-1)
#define rep(i,n,m) for(int i=n;i<=m;i++)
#define per(i,n,m) for(int i=n;i>=m;i--)
#define repp(i,n) for(int i=0;i<n;i++)
#define bug1(i) cout<<i<<endl
#define bug2(i,j) cout<<i<<" "<<j<<endl
#define bug3(i,j,k) cout<<i<<" "<<j<<" "<<k<<endl
#define bug4(i,j,k,l) cout<<i<<" "<<j<<" "<<k<<" "<<l<<endl
#define mod 1234567891 //998244353.1000000007
#define maxn 200005
#define eps 1e-6
#define int ll
using namespace std;

ll dp[70][50005];
ll a[70],s,n,m;

void solve(){
	cin>>n>>m;
	rep(i,1,n) cin>>a[i],s+=a[i];
	dp[0][0]=1;
	
	for(int b=0;b<=62;b++){
//		cout<<b<<endl;
		for(int i=1;i<=n;i++){
			for(int j=2*s-a[i];j>=0;j--){
				dp[b][j+a[i]]=(dp[b][j+a[i]]+dp[b][j])%mod;
			}
		}	
//		cout<<b<<endl;
		for(int j=2*s;j>=0;j--){
			if( (j&1) == ((m>>b)&1)) dp[b+1][j/2]=(dp[b+1][j/2]+dp[b][j])%mod;
		}
	}
	
	cout<<dp[62][0];
}

/*

*/
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);int ca=1;
//	cin>>ca;
	while(ca--){
		solve();
//		cerr<<endl;
	}
	return 0;
}