#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;

int main(){
	ll n, m, s = 0;
	cin >> n >> m;
	modint::set_mod(1234567891);
	vector<int> a(n);
	for (auto &x : a) cin >> x; 

	for (int i = 0; i < n; i++) s += a[i];
	vector<modint> pre(2 * s + 1), dp(2 * s + 1);

	pre[0] = 1;
	for (int i = 0; (1ll<<i) <= m; i++){
		dp = pre;
		pre = vector<modint>(2 * s + 1);
		for (int j = 0; j < n; j++){
			for (int k = 2 * s; k >= a[j]; k--){
				dp[k] += dp[k - a[j]];
			}
		}

		for (int j = 0; j <= 2 * s; j++){
			if ((bool)(m & 1ll<<i) == (bool)(j & 1)){
				pre[j / 2] = dp[j];
			}
		}
	}
	cout << pre[0].val() << endl;
}