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

#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
const int mod = 1000000007;
const long long INF = 1LL << 60;
using ll = long long;

int main()
{
  ll N,W;
  cin >> N >> W;

  vector<int> a(2*N);
  rep(i,N){
    cin >> a[i];
    a[i+N]=a[i]/2;
  }

  set<set<int>> ansset;

  rep(k,1<<N){
    ll price=0;
    set<int> se;
    rep(i,2*N){
      if((1<<i)&k){
        price+=a[i];
        se.insert(i%N);
      }
    }
    if(price==W){
      ansset.insert(se);
    }
  }
  cout << ansset.size() << endl;
}