#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define IFOR(i, m, n) for (ll i = n - 1; i >= m; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define SZ(x) ll(x.size())

ll n, w, N;
vector<ll> a;
ll sum = 0, bit = 0;
map<ll, bool> mp;

void dfs(ll pos, ll sel) {
  if (pos == n) {
    if (sum == w && bit > 0) {
      mp[bit] = true;
    }
    return;
  }

  REP(i, 3) {
    ll preSum = sum;
    ll preBit = bit;
    if (pos >= 0) {
      if (sel == 1) {
        sum += a[pos];
        bit += 1LL << pos;
      } else if (sel == 2) {
        sum += a[pos] / 2;
        bit += 1LL << pos;
      }
    }
    dfs(pos + 1, i);
    sum = preSum;
    bit = preBit;
  }
}

int main() {
  cin >> n >> w;

  ll z = 0;
  REP(i, n) {
    ll x;
    cin >> x;
    if (x > 0) {
      a.push_back(x);
    } else {
      z++;
    }
  }
  n = SZ(a);
  N = 1LL << n;

  if (w == 0) {
    cout << (1LL << z) - 1 << endl;
    return 0;
  }

  dfs(-1, -1);

  cout << SZ(mp) * (1LL << z) << endl;
}