#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using pii = pair <int, int>;
//~ const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
const ll mod = 1234567891;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 55, M = 5e4 + 11;

int a[N];
ll f[M], g[M];

void upd(ll &a, ll b) {
	a += b;
	if(a >= mod) a -= mod;
}

int main() {
	ios :: sync_with_stdio(false);
	
	int n; ll m;
	cin >> n >> m;
	for(int i = 1; i <= n; i ++)
		cin >> a[i];
	
	f[0] = 1;
	while(m) {
		for(int i = 1; i <= n; i ++)
			for(int j = M - 1; j >= a[i]; j --)
				upd(f[j], f[j - a[i]]);
		
		memset(g, 0, sizeof g);
		for(int i = 0; i < M; i ++)
			if((m + i) % 2 == 0)
				g[i / 2] = f[i];
		swap(f, g);
		m /= 2;
	}
	
	cout << f[0] << '\n';
}