#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
ll A[8],S;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>S;
	vector<ll> X={0},Y={0};
	FOR(i,N) {
		cin>>A[i];
		ll a=1;
		vector<ll> V;
		while(1) {
			a*=A[i];
			if(a>=S) break;
			V.push_back(a);
		}
		
		if(i<4) {
			vector<ll> Z;
			FORR(x,X) FORR(v,V) if(x+v<=S) Z.push_back(x+v);
			X=Z;
		}
		else {
			vector<ll> Z;
			FORR(x,Y) FORR(v,V) if(x+v<=S) Z.push_back(x+v);
			Y=Z;
		}
	}
	
	
	ll ret=0;
	sort(ALL(Y));
	FORR(x,X) {
		y=lower_bound(ALL(Y),S-x+1)-Y.begin();
		ret+=y;
	}
	cout<<ret<<endl;
	
	
	
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}