#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { ll B, T, F, P; };

ll MOD = 1234567891;
ll _MOD = 1000000009;
double EPS = 1e-10;
int INF = INT_MAX / 10;

ll f(ll M, int l, int r, vector<int>& A, unordered_map<ll, ll>& mp) {
	ll unko = (M * 50 + l) * 50 + r;
	if (mp.count(unko)) return mp[unko];
	if (M < 0) return 0;
	if (M == 0) return 1;
	if (l >= r) return 0;
	int N = A.size();
	ll sum = 0;
	for (int m = l; m < r; m++)
		for (int i = 0; i < A[m]; i++)
			if (M / 2 - i >= 0 && M - (M / 2 - i + A[m]) >= 0)
				sum += (f(M / 2 - i, l, m + 1, A, mp) * f(M - (M / 2 - i + A[m]), m, r, A, mp)) % MOD;
	return mp[unko] = sum % MOD;
}

int main() {
	int N; ll M; cin >> N >> M;
	vector<int> A(N);
	for (int i = 0; i < N; i++)
		cin >> A[i];
	unordered_map<ll, ll> mp;
	cout << f(M, 0, N, A, mp) << endl;
}