#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>

using namespace std;

int n;
long long w;
vector<long long> a;
map<vector<int>,int> mp;
vector<int> v;
bool f = false;

void dfs(long long sum , int id) {
  //cout << id << " " << sum << endl;
  if (id >= n) {
    if (sum == w) {
      if (f) mp[v]++;
    }
    return;
  }
  dfs(sum , id + 1);
  v.push_back(id);
  f = true;
  dfs(sum + a[id] , id + 1);
  v.pop_back();
  v.push_back(id);
  f = true;
  dfs(sum + a[id] / 2 , id + 1);
  v.pop_back();
  return;
}

int main() {
  cin >> n >> w;
  a = vector<long long>(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  dfs(0,0);
  cout << mp.size() << endl;
  return 0;
}