#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N,S;
vector<int>A;
vector<int>ret;
void dfs(int id,int now)
{
	if(id==A.size())ret.push_back(now);
	else
	{
		long t=A[id];
		while(now+t<=S)
		{
			dfs(id+1,now+t);
			t*=A[id];
		}
	}
}
vector<pair<int,long> >f(vector<int>A_)
{
	A=A_;
	dfs(0,0);
	vector<pair<int,long> >cnt;
	sort(ret.begin(),ret.end());
	for(int i=0;i<ret.size();)
	{
		int j=i;
		while(j<ret.size()&&ret[i]==ret[j])j++;
		cnt.push_back(make_pair(ret[i],j-i));
		i=j;
	}
	ret.clear();
	return cnt;
}
main()
{
	cin>>N>>S;
	vector<int>Ai(N);
	for(int i=0;i<N;i++)cin>>Ai[i];
	vector<pair<int,long> >L=f(vector<int>(Ai.begin(),Ai.begin()+N/2));
	vector<pair<int,long> >R=f(vector<int>(Ai.begin()+N/2,Ai.end()));
	int r=0;
	long ans=0,sum=0;
	for(int l=L.size();l--;)
	{
		while(r<R.size()&&R[r].first+L[l].first<=S)
		{
			sum+=R[r++].second;
		}
		ans+=sum*L[l].second;
	}
	cout<<ans<<endl;
}