#include <bits/stdc++.h>
using namespace std;

using VS = vector<string>;    using LL = long long;
using VI = vector<int>;       using VVI = vector<VI>;
using PII = pair<int, int>;   using PLL = pair<LL, LL>;
using VL = vector<LL>;        using VVL = vector<VL>;

#define ALL(a)  begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i, s, e) for (int(i) = (s); (i) < (e); (i)++)
#define FORR(i, s, e) for (int(i) = (s); (i) > (e); (i)--)
#define debug(x) cerr << #x << ": " << x << endl
const int INF = 1e9;                          const LL LINF = 1e16;
const LL MOD = 1234567891;                    const double PI = acos(-1.0);
int DX[8] = { 0, 0, 1, -1, 1, 1, -1, -1 };    int DY[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };

/* -----  2018/05/02  Problem: yukicoder 137  / Link: http://yukicoder.me/problems/no/137  ----- */
/* ------問題------



-----問題ここまで----- */
/* -----解説等-----

これすごい

----解説ここまで---- */

LL ans = 0LL;

int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	LL N, M; cin >> N >> M;
	VI a(N);
	FOR(i, 0, N) {
		cin >> a[i];
	}

	VL dp(50004, 0);
	dp[0] = 1;
	while (M) {
		FOR(i, 0, N) {
			FORR(j, 50000, a[i] - 1) {
				dp[j] += dp[j - a[i]];
				dp[j] %= MOD;
			}
		}
		// Mの下位桁から使用しなくなるので圧縮
		FOR(i, 0, 25001)dp[i] = dp[2 * i + M % 2];
		FOR(i, 25001, 50004)dp[i] = 0;

		M /= 2;
	}

	ans = dp[0];
	cout << ans << "\n";

	return 0;
}