#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

// HANBUN ZENREKKYO

// importbisect
template <typename T>
int bisect_left(vector<T> &X, T v){
	return lower_bound(X.begin(), X.end(), v) - X.begin();
}

template <typename T>
int bisect_right(vector<T> &X, T v){
	return upper_bound(X.begin(), X.end(), v) - X.begin();
}
// -----


int main(){
	int n; ll s; cin >> n >> s;
	vector<ll> a(n);
	rep(i,0,n) cin >> a[i];


	auto rekkyo = [&](auto self, ll nw, int lft, int rgt, vector<ll> &x) -> void {
		if (nw > s) return;
		if (lft >= rgt){
			x.push_back(nw);
			return;
		}
		ll v = a[lft];
		while(v + nw <= s){
			self(self, v + nw, lft + 1, rgt, x);
			v *= a[lft];
		}
	};

	if (n <= 4){
		vector<ll> r;
		rekkyo(rekkyo, 0, 0, n, r);
		ll ans = 0;
		for (ll i: r){
			if (i <= s) ans++;
		}
		cout << ans << '\n';
	}else{
		vector<ll> r1;
		vector<ll> r2;
		rekkyo(rekkyo, 0, 0, n/2, r1);
		rekkyo(rekkyo, 0, n/2, n, r2);
		sort(r2.begin(), r2.end());
		ll ans = 0;
		for (ll i: r1){
			ans += bisect_right(r2, s - i);
		}
		cout << ans << '\n';
	}

}