#include <bits/stdc++.h> using namespace std; #define rep(i,n) for(int i=0; i<(n); i++) #define INF ((1LL<<62)-(1LL<<31)) #define all(a) (a).begin(),(a).end() #define rall(a) (a).rbegin(),(a).rend() typedef long long ll; typedef pair<ll,ll> pl; int main() { ll n,w; cin >> n >> w; vector<ll> a(n); rep(i,n) cin >> a[i]; ll cnt=0; for(int bit=1;bit<(1<<n);bit++) { bool flag=false; vector<ll> v; ll sum=0; rep(i,n) { if(1<<i&bit) { v.push_back(a[i]); sum+=a[i]; } } int x=v.size(); for(int bit2=0;bit2<(1<<x);bit2++) { ll tot=sum; rep(i,x) if(1<<i&bit2) tot-=v[i]/2; if(tot==w) flag=true; } if(flag) cnt++; } cout << cnt << endl; return 0; }