#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define INF 1000000000
#define MOD 998244353
#define MAX 300000

void dfs(vector<ll> &a,int i,ll sum,ll S,vector<ll> &A){
  if(i==a.size()){
    A.push_back(sum);
    return;
  }
  ll x=a[i];
  int k=1;
  while(sum+x<=S){
    dfs(a,i+1,sum+x,S,A);
    x*=a[i];
    k++;
  }
}

int main(){
  int n;
  ll S;
  cin>>n>>S;
  vector<ll> a,b;
  for(int i=0;i<n;i++){
    ll x;
    cin>>x;
    if(i%2==0){
      a.push_back(x);
    }else{
      b.push_back(x);
    }
  }

  vector<ll> A,B;
  dfs(a,0,0,S,A);
  dfs(b,0,0,S,B);
  sort(A.begin(),A.end());
  sort(B.begin(),B.end());

  ll ans=0;
  for(int i=0;i<A.size();i++){
    int k=upper_bound(B.begin(),B.end(),S-A[i])-B.begin();
    ans+=(ll)k;
  }
  cout<<ans<<endl;
}