#include <bits/stdc++.h>
#define int long long
using namespace std;
constexpr int lim = 1e7;
int n, W, B, a[65], s[65], p;
int f[lim], res;
void dfs(int u, int cur) {
	if (cur < 0 || cur > s[u]) return;
	if (u == p) {
		res += f[cur];
		return;
	}
	for (int j : {0ll, a[u], a[u] * 2}) {
		dfs(u - 1, cur - j);
	}
}
signed main() {
	cin >> n >> W;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		s[i] = s[i - 1] + a[i] * 2;
	}
	while (p < n && s[p + 1] < lim) p++;
	f[0] = 1;
	for (int i = 1; i <= p; i++) {
		for (int k = lim - 1; k >= a[i]; k--) {
			f[k] += f[k - a[i]];
			if (k >= a[i] * 2) f[k] += f[k - a[i] * 2];
		}
	}
	dfs(n, W);
	cout << res << "\n";
	return 0;
}