#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
#define FOR(i, f, t)        for(int(i)=(f);(i)<(t);++(i))
const int MOD = 1234567891;

const ll MAX = 2*50*500;
ll N,M,A[55],dp[50005];

int main(){
    cin >> N >> M;
    REP(j,N) cin >> A[j];

#ifdef _DEBUG
    int i = 0;
    ll L = 0;
#endif

    dp[0] = 1;
    while(M){
        REP(j,N) for(int k = MAX; k >= A[j]; k--){
            dp[k] = (dp[k] + dp[k-A[j]]) % MOD;
        }
        int b = M % 2;
        REP(j,MAX/2+1) dp[j] = dp[j*2+b];
        FOR(j,MAX/2+1,MAX+1) dp[j] = 0;

#ifdef _DEBUG
        L |= (ll)b << i;
        fprintf(stderr, "----\n");
        REP(j,min(MAX,M/2)+1){
            if(dp[j] > 0)
                fprintf(stderr,"dp[%lld] = %lld\n", ((ll)j<<(i+1))+L, dp[j]);
        }
        i++;
#endif
        M /= 2;
    }
    cout << dp[0] << endl;

    return 0;
}