#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#ifdef LOKAL
#include "DEBUG_TEMPLATE.h"
#else
#define HERE
#define debug(args...)
#endif
typedef pair<int,int> pii;
#define ALL(x) x.begin(),x.end()

const int N = 1000 +5;
const ll oo = 1234567891LL;

int n;
ll m;
int pos[N];
int a[N];
ll save[65][N];

ll dp(int i,int c)
{
	if(i==5)
		return c==0;
	ll &ret=save[i][c];
	if(ret!=-1) return ret;
	ret=0;
	for(int j=0;j<N;j++)
	{
		int now = c+j;
		if(((now >>0)&1) == ((m>>i)&1))
		{
			ll x = dp(i+1,now/2);
			ret = (ret + pos[j] * x)%oo;
		}
	}
	return ret;
}

void solve()
{
	cin>>n>>m;
	pos[0]=1;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
		for(int j=N-1;j>=a[i];j--)
			pos[j]=(pos[j]+pos[j-a[i]])%oo;
	}
	for(int i=0;i<=m;i++)
		debug(i,pos[i]);
	memset(save,-1,sizeof(save));
	cout<<dp(0,0)<<endl;
}
/*

*/

int32_t main()
{
#ifndef LOKAL
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int T=1;
    // cin>>T;
    while(T--)
    {
        solve();
    }
    return 0;
}