#include <bits/stdc++.h>

using namespace std;

namespace {

    typedef double real;
    typedef long long ll;

    template<class T> ostream& operator<<(ostream& os, const vector<T>& vs) {
        if (vs.empty()) return os << "[]";
        os << "[" << vs[0];
        for (int i = 1; i < vs.size(); i++) os << " " << vs[i];
        return os << "]";
    }
    template<class T> istream& operator>>(istream& is, vector<T>& vs) {
        for (auto it = vs.begin(); it != vs.end(); it++) is >> *it;
        return is;
    }

    int N; ll M;
    vector<int> A;
    void input() {
        cin >> N >> M;
        A.resize(N); cin >> A;
    }

    const ll MOD = 1234567891LL;

    void solve() {
        ll g[500 * N + 1];
        memset(g, 0, sizeof(g));
        g[0] = 1;
        for (int i = 0; i < N; i++) {
            for (int j = 500*N; j >= 0; j--) {
                if (j - A[i] >= 0) g[j] = (g[j] + g[j - A[i]]) % MOD;
            }
        }

        ll f[61][500 * N + 1];
        memset(f, 0, sizeof(f));
        for (ll x = 0; x <= 500*N; x++) {
            if ( (x & 1LL) == (M & 1LL) ) {
                f[0][x] = g[x];
            }
        }
        for (int p = 1; p <= 60; p++) {
            for (ll x = 0; x <= 500*N; x++) {
                if ( (M & (1LL<<p)) == ((x & 1LL)<<p) ) {
                    for (ll k = 0; k <= min(500LL*N, 2*x + 1); k++) {
                        f[p][x] = (f[p][x] + f[p - 1][k] * g[x - k / 2]) % MOD;
                    }
                }
            }
        }
        /*
        for (int p = 0; p < 5; p++) {
            for (ll x = 0; x < 10; x++) {
                cout << f[p][x] << " ";
            }
            cout << endl;
        }
        */
        cout << f[60][0] << endl;
    }
}

int main() {
    input(); solve();
    return 0;
}