#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n, s; cin >> n >> s;
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<int> fact(n + 1, 1);
  REP(i, n) fact[i + 1] = fact[i] * (i + 1);
  ll base = 1;
  for (int i = 0; i < n;) {
    int j = i + 1;
    while (j < n && a[j] == a[i]) ++j;
    base *= fact[j - i];
    i = j;
  }
  ll ans = 0;
  vector<int> k(n);
  auto f = [&](auto&& f, int i, int prv, int block, ll sum, ll ways) -> void {
    if (i == n) {
      ans += ways / fact[block];
      return;
    }
    for (ll x = (i == 0 || a[i - 1] != a[i] ? a[i] : prv); sum + x <= s; x *= a[i]) {
      k[i] = x;
      if (i == 0 || a[i - 1] != a[i] || x != prv) {
        f(f, i + 1, x, 1, sum + x, ways / fact[block]);
      } else {
        f(f, i + 1, x, block + 1, sum + x, ways);
      }
    }
  };
  f(f, 0, 0, 0, 0, base);
  cout << ans << '\n';
  return 0;
}