#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
//#define MOD 1000000007
#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
#define PI acos(-1.0)

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;
//using mint = modint998244353;

int dh[] = {-1,0,1,0};
int dw[] = {0,1,0,-1};


int main(){
    int n; cin >> n;
    ll w; cin >> w;
    vector<ll> a(n);
    rep(i,n) cin >> a[i];
    vector<ll> b(n);
    rep(i,n) b[i] = a[i]/2;

    ll ans = 0;
    repr(i,1,1<<n){
        ll tmp = 0;
        vector<int> id;
        rep(j,n){
            if(i>>j&1){
                tmp += a[j];
                id.push_back(j);
            }
        }
        bool ok = false;

        int k = id.size();
        rep(j,1<<k){
            ll tmp2 = tmp;
            rep(l,k) if(j>>l&1) tmp2 = tmp2-a[id[l]]+b[id[l]];
            if(tmp2 == w) ok = true;
        }

        if(ok) ans++;
    }
    cout << ans << endl;

}