#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	ll n,w;
	cin>>n>>w;
	vector<ll> p(n);
	rep(i,n) cin>>p[i];
	int ans=0;
	rep(i,(1<<n)){
		if(i==0) continue;
		ll sum=0;
		ll tmp=0;
		vector<ll> q;
		rep(j,n){
			if(i&(1<<j)){
				sum+=p[j];
				q.push_back(p[j]);
			}
		}
		int m=q.size();
		rep(j,(1<<m)){
			ll val=0;
			rep(k,m){
				if(j&(1<<k)){
					val+=q[k]/2;
				}
				if(sum-val==w) tmp=1;
			}
		}
		ans+=tmp;
	}
	cout<<ans<<"\n";
}