/* -*- coding: utf-8 -*-
 *
 * 1929.cc:  No.1929 Exponential Sequence - yukicoder
 */

#include<cstdio>
#include<map>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 8;
const int MAX_M = 30 * 30 * 30 * 30;

/* typedef */

typedef long long ll;
typedef map<int,int> mii;

/* global variables */

int as[MAX_N], bs[MAX_M], ss[MAX_M + 1];

/* subroutines */

void rec(int k, int n, int s, int sum, mii &scs) {
  if (k >= n) {
    scs[sum]++;
    return;
  }

  for (ll ea = as[k]; sum + ea <= s; ea *= as[k])
    rec(k + 1, n, s, sum + ea, scs);
}

/* main */

int main() {
  int n, s;
  scanf("%d%d", &n, &s);
  for (int i = 0; i < n; i++) scanf("%d", as + i);

  int h = n / 2;
  mii scs0, scs1;
  if (h > 0) rec(0, h, s, 0, scs0);
  if (h < n) rec(h, n, s, 0, scs1);

  if (h == 0) { printf("%d\n", (int)scs1.size()); return 0; }

  int m = 0;
  for (auto sc: scs1) {
    bs[m] = sc.first;
    ss[m + 1] = ss[m] + sc.second;
    m++;
  }

  ll sum = 0;
  for (auto sc: scs0) {
    int si = sc.first, ci = sc.second;
    int k = upper_bound(bs, bs + m, s - si) - bs;
    sum += (ll)ci * ss[k];
  }

  printf("%lld\n", sum);
  return 0;
}