#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, j, n) for (int i = j; i < (n); ++i)
#define rrep(i, j, n) for (int i = (n)-1; j <= i; --i)
#define all(a) a.begin(), a.end()
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> &a) {
  for (size_t i = 0; i < a.size(); ++i) os << (i > 0 ? " " : "") << a[i];
  return os << '\n';
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
  for (T &x : a) { is >> x; }
  return is;
}
[[maybe_unused]] constexpr long long MOD = 998244353;
// constexpr long long MOD = 1000000007;
[[maybe_unused]] constexpr int INF = 0x3f3f3f3f;
[[maybe_unused]] constexpr long long INFL = 0x3f3f3f3f3f3f3f3fLL;

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n, s;
  cin >> n >> s;
  vector<int> a(n);
  cin >> a;
  int m = (n + 1) / 2;
  map<ll, ll> mp, pm;
  // 1
  mp[0] = 1;
  rep(i, 0, m) {
    map<ll, ll> nmp;
    for (auto [j, k] : mp) {
      ll c = a[i];
      while (j + c <= s) {
        nmp[j + c] += k;
        c *= a[i];
      }
    }
    mp = nmp;
  }

  // 2
  pm[0] = 1;
  rep(i, m, n) {
    map<ll, ll> nmp;
    for (auto [j, k] : pm) {
      ll c = a[i];
      while (j + c <= s) {
        nmp[j + c] += k;
        c *= a[i];
      }
    }
    pm = nmp;
  }

  vector<ll> A{0}, B{0};
  for (auto [k, v] : pm) {
    A.push_back(k);
    B.push_back(v);
  }
  rep(i, 1, B.size()) B[i] += B[i - 1];

  ll ans = 0;
  for (auto [k, v] : mp) {
    ll aaa = s - k;
    ans += v * B[upper_bound(A.begin(), A.end(), aaa) - A.begin() - 1];
  }
  cout << ans;
  return 0;
}