#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

ll n;
ll s;
vl v;
vl res;
ll limit;
void dfs(ll sum,ll depth){
  if(depth==limit){
    res.emplace_back(sum);
    return;
  }
  ll ret=1;
  for(ll i=1;i<=31;i++){
    ret*=v[depth];
    if(sum+ret>s)break;
    dfs(sum+ret,depth+1);
  }
}
ll ans=0;
void dfs2(ll sum,ll depth){
  if(depth==limit){
    ans+=upper_bound(all(res),s-sum)-res.begin();
    return;
  }
  ll ret=1;
  for(ll i=1;i<=31;i++){
    ret*=v[depth];
    if(sum+ret>s)break;
    dfs2(sum+ret,depth+1);
  }
}
int main(){
  cin >> n;
  cin >> s;
  v.resize(n);
  rep(i,n)cin >> v[i];
  if(n<=5){
    limit=n;
    dfs(0,0);
    cout << res.size() << endl;
    return 0;
  }
  limit=4;
  dfs(0,0);
  sort(all(res));
  rev(all(v));limit=n-4;
  dfs2(0,0);
  cout << ans << endl;
}