/*
サンプルに最大ケースがあるから全列挙っぽい
通り数を数えると無理
*/
#include<iostream>
#include<set> 
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
#include <unordered_set>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<ll,ll> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;

int main(){
    int n;
    ll S;
    cin>>n>>S;

    vector<ll> a(n);
    vector<ll> a0,a1;
    for(int i=0;i<n;i++){
    
        cin>>a[i];
        if(i%2==0){
            a0.push_back(a[i]);
        }else{
            a1.push_back(a[i]);
        }
    }

    
 

    auto dfs=[&](auto f,ll s,int idx,const vector<ll>&a,vector<ll>& res)->void{
        if(idx==a.size()){
            res.push_back(s);
            return ;
        }
        //s-=x; 
        ll x=a[idx];
        while(s+x<=S){

            if(s+x>S) break;

            f(f,s+x,idx+1,a,res);
            
            x*=a[idx];
        }
    };


    vector<ll> res0,res1;
    dfs(dfs,0,0,a0,res0);
    dfs(dfs,0,0,a1,res1);

    sort(res0.begin(),res0.end());
    sort(res1.begin(),res1.end());

    ll ans=0;
    for(ll v:res0){
        auto it=upper_bound(res1.begin(),res1.end(),S-v);

        ll num=it-res1.begin();
        ans+=num;
    }
    cout<<ans<<endl;

    


}