#include <bits/stdc++.h>
using namespace std;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N, W;
	cin >> N >> W;
	vi v(N);
	vin(v);
	rep(i, N) v.pb(v[i]/2);

	lint a=0, b=0, c=0, x, y, z;
	set<lint> s;
	rep(bit, 1<<(N*2)) {
		bitset<26> bits = bit;
		a = 0;
		bool f = true;
		rep(i, N) {
			if (bits.test(i) && bits.test(i+N)) f = false;
			if (bits.test(i) || bits.test(i+N)) a += 1<<i;
		}
		if (!f) continue;
		b = 0;
		rep(i, N*2) {
			if (bits.test(i)) b += v[i];
		}
		if (b == W) s.insert(a);
	}
	std::cout << s.size() << '\n';
}