#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x) {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x) {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x) {return (x==0?-1:__builtin_ctzll(x));}

#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

const int N=55,M=50005,mod=1234567891;
int n,m,a[N],f[N][M][2],sum;
void pls(int &x,int y) {x+=y; if(x>=mod) x-=mod;}

signed main() {
  n=read(), m=read();
  f[0][0][0]=1;
  rep(i,1,n) a[i]=read(), sum+=2*a[i];
  rep(h,0,60) {
    if(h) {
      rep(i,0,n-1) rep(j,0,sum) rep(k,0,1) f[i][j][k]=0;
      rep(j,0,sum) pls(f[0][j/2][j%2],f[n][j][(m>>(h-1))&1]);
      rep(j,0,sum) rep(k,0,1) f[n][j][k]=0;
    }
    rep(i,0,n-1) rep(j,0,sum) rep(k,0,1) {
      pls(f[i+1][j][k],f[i][j][k]);
      int nj=j+a[i+1]/2+(k+a[i+1]%2)/2;
      if(nj<=sum) pls(f[i+1][nj][k^(a[i+1]%2)],f[i][j][k]);
    }
  }
  printf("%lld\n",f[n][0][(m>>60)&1]);
  return 0;
}