#include <cstdio>
#include <queue>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>

using namespace std;

long long dp[51][50002];
int main(){
   long long N,M;
   cin >> N >> M;
   int A[N];
   int sum=0;
   for( int i = 0 ; i <N ; i++ ) cin>>A[i],sum+=A[i];
   dp[0][0]=1;
   int mod=1234567891;
   while(M>0){
      for( int i = 0 ; i <N ; i++ ){
       for( int j = 2*sum; j>=0;j--){
         dp[i+1][j]=dp[i][j];
         if( j-A[i] >=0){
            dp[i+1][j]+=dp[i][j-A[i]];
            dp[i+1][j]%=mod;
         }
       }
      }
      for( int i=0; i<=sum; i++ ){
         //if( i*2+M%2 <= M) cout << i*2+M%2 << "="<<dp[N][i*2+M%2]<<endl;
         dp[0][i]=dp[N][i*2+M%2];
      }
      for( int i=sum+1; i< 2*sum+2; i++ ){
         dp[0][i]=0;
      }
      M/=2;
   }
   cout << dp[0][0];
   return 0;
}