#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<pair<long long,long long>> calc(vector<long long> v,long long s){
  map<long long,long long>mp;
  mp[0] =1;
  rep(i,v.size()){
      long long x =1;
      map<long long,long long>tmp;
      while(x  <= INF/v[i]){
        x *= v[i];
        for(auto &[k,v]:mp){
          long long nk = k + x;
          if(nk >s)continue;
          tmp[nk] += v;
        }
      }
    swap(mp,tmp);
    }
  vector<pair<long long,long long>>ret;
  for(auto [k,v]:mp){
    ret.push_back({k,v});
   }
  return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
    int n;cin >> n;
 	long long s;cin >> s;
  	vector<long long>a,b;
  	rep(i,n){
      int x;cin >>x;
      if(0 == i%2)a.push_back(x);
      else b.push_back(x);
    }
  	auto va = calc(a,s);
  	auto vb = calc(b,s);
    long long ans = 0;
  	long long sub = 0;
  	rep(i,vb.size())sub += vb[i].second;
  	if(vb.empty()){
      cout << 0 <<endl;
      return 0;
    }
  	int j = vb.size()-1;
    rep(i,va.size()){
      long long lim = s-va[i].first;
      while((j>=0)&&(vb[j].first>lim)){
        sub -= vb[j].second; 
       	j--;
      }
      ans += va[i].second * sub;
    }
  	cout << ans << endl;
	return 0;
}