#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, W, M, ans=0, S;
    cin >> N >> W;
    M = 1<<N;
    vector<int> a(N);
    for (int i=0; i<N; i++) cin >> a[i];
    vector<bool> ok(M);
    for (int i=1; i<M; i++){
        for (int j=0; j<M; j++){
            if ((i & j) != j) continue;
            S = 0;
            for (int k=0; k<N; k++){
                if (1<<k & i){
                    if (1<<k & j) S += a[k]/2;
                    else S += a[k];
                }
            }
            if (S == W) ok[i] = 1;
        }
    }

    for (int i=0; i<M; i++) if (ok[i]) ans++;
    cout << ans << endl;

    return 0;
}