#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAXN = 55;
const ll MOD = 1234567891;
int A[MAXN];
ll dp[500*101];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    ll M;
    cin >> N >> M;
    for (int i = 0; i < N; i++) cin >> A[i];
    dp[0] = 1;
    while (M) {
        for (int i = 0; i < N; i++) {
            for (int j = 100*500; j >= A[i]; j--) {
                (dp[j] += dp[j-A[i]]) %= MOD;
            }
        }
        for (int i = 0; i <= 50*500; i++) {
            dp[i] = dp[i*2+M%2];
        }
        for (int i = 0; i <= 50*500; i++) {
            dp[i+50*500] = 0;
        }
        M /= 2;
    }
    cout << dp[0] << endl;
    return 0;
}