#include <cstdio>
#include <cassert>
#include <cstring>
#include <ctime>

#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <utility>

#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep3(i, m, n) for (int i = int(m); i < int(n); ++i)

using namespace std;
using int64 = long long;

const int64 MOD = 1234567891;

int A[50];
int64 poly[50010];

void solve() {
  int64 N, M;
  while (~scanf("%lld %lld", &N, &M)) {
    int64 s = 0;
    rep(i, N) scanf("%d", &A[i]), s += A[i];
    poly[0] = 1;
    int64 t = 1;
    while (M) {
      fill(poly + t, poly + s + t, 0);
      rep(i, N) {
        for(int j = t - 1; j >= 0; --j) {
          if (poly[j]) (poly[j + A[i]] += poly[j]) %= MOD;
        }
        t += A[i];
      }
      int p = M & 1;
      M >>= 1;
      t = (t + 1 - p) >> 1;
      rep(i, t) poly[i] = poly[2 * i + p];
    }
    printf("%lld\n", poly[0]);
  }
}

int main() {
  solve();
  return 0;
}