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

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define pb push_back
#define m0(x) memset(x,0,sizeof(x))
#define fill(x,y) memset(x,y,sizeof(x))
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vvs vector<vs>
#define vc vector<char>
#define vvc vector<vc>
#define pii pair<int,int>
#define pllll pair<ll,ll>
#define vpii vector<pair<int,int>>
#define vpllll vector<pair<ll,ll>>
#define vpis vector<pair<int,string>>
#define vplls vector<pair<ll, string>>
#define vpsi vector<pair<string, int>>
#define vpsll vector<pair<string, ll>>

#define int ll

using ll = long long;
using ld = long double;
using ull = unsigned long long;

void print_vec(vector<int> &a) {
    for(int i = 0; i < (int)a.size(); i++) {
        cout << a[i];
        if(i != a.size() - 1) cout << " ";
    }
    cout << "\n";
}

const ll INF = 1e15;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};

void solve() {
    int n, w;
    cin >> n >> w;
    vi a(n);
    FOR(n) {
        cin >> a[i];
    }
    map<int, int> mp;
    rep(i, 1 << n) {
        int now = 0;
        vector<int> ids;
        rep(j, n) {
            if(i & 1 << j) {
                now += a[j];
                ids.push_back(j);
            }
        }
        map<int, bool> done;
        rep(j, 1 << ids.size()) {
            int v = 0;
            rep(k, ids.size()) {
                if(j & 1 << k) {
                    v += a[ids[k]] / 2;
                }
            }
            if(done[now - v]) continue;
            done[now - v] = true;
            mp[now - v]++;
        }
    }
    cout << mp[w] << endl;
    /*
    map<int, int> mp;
    rep(i, 1 << n) {
        int now = 0;
        rep(j, n) {
            if(i >> j & 1) {
                now += a[j];
            }
        }
        mp[now]++;
    }
    if(mp[w] > 0) {
        cout << 
    }
    rep(i, 1 << n) {
        int now = 0;
        rep(j, n) {
            if(i >> j & 1) {
                now += a[j] / 2;
            }
        }
        if(mp[])
    }
    */
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}