#include <bits/stdc++.h>
//eolibraries
#define lnf 3999999999999999999
#define inf 999999999
#define fi first
#define se second
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define sz(c) (i64)(c).size()
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end());
#define rep(i,n) for(i64 i=0;i<n;i++)
#define drep(i,n) for(i64 i=n-1;i>=0;i--)
#define crep(i,x,n) for(i64 i=x;i<n;i++)
#define vec(...) vector<__VA_ARGS__>
#define _3ioVv0Q ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
//eodefine
using namespace std;
typedef long long i64;
typedef long double ld;
using pii=pair<i64,i64>;
using tpii=pair<i64,pii>;
using vi=vec(i64);
const i64 mxn=12000;

int main(){
_3ioVv0Q;
	i64 n,w;
	cin>>n>>w;
	vi a(n);
	rep(i,n){
		cin>>a[i];
	}
	i64 ans=0;
	rep(msk,(1<<n)){
		vi rbts;
		rep(i,n){
			if(msk&(1<<i)){
				rbts.pb(a[i]);
			}
		}
		i64 m=sz(rbts);
		bool pok=0;
		rep(nemsk,(1<<m)){
			i64 sum=0;
			rep(i,m){
				if(nemsk&(1<<i)){
					sum+=rbts[i]/2;
				}else{
					sum+=rbts[i];
				}
			}
			if(sum==w){
				pok=1;
				break;
			}
		}
		ans+=pok;
	}
	cout<<ans<<"\n";
	// pri64f("%d\n",ans);
//	
	return 0;
}