//まごうことなき良問。O(NΣAi logM)
#include <iostream>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;

int mod = 1234567891;
int n, m;
int a[50];
int dp[51][60001];

signed main() {
	int i, j, k;
	
	cin >> n >> m;
	rep(i, n) cin >> a[i];
	
	dp[0][0] = 1;
	rep(i, 60) {
		rep(j, n) {
			rep(k, 60001) {
				if (!dp[j][k]) continue;
				(dp[j + 1][k] += dp[j][k]) %= mod;
				(dp[j + 1][k + a[j]] += dp[j][k]) %= mod;
			}
		}
		
		static int tmp[30001];
		rep(j, 30000) {
			tmp[j] = dp[n][2 * j + (m >> i) % 2];
		}
		
		rep(j, n + 1) rep(k, 60001) dp[j][k] = 0;
		rep(j, 30000) dp[0][j] = tmp[j];
	}
	cout << dp[0][0] << endl;
	return 0;
}