#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

int main(){
    int N; ll W;
    cin >> N >> W;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];

    set<int> st;
    for(int bit = 0; bit < (1<<N); ++bit){
        vector<ll> B = A;
        rep(i, 0, N){
            if(bit & (1<<i)){
                B[i] /= 2LL;
            }
        }
        for(int bit2 = 1; bit2 < (1<<N); ++bit2){
            ll val = 0LL;
            rep(j, 0, N){
                if(bit2 & (1<<j)){
                    val += B[j];
                }
            }
            if(val == W) st.insert(bit2);
        }
    }
    cout << st.size() << endl;

    return 0;
}