#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)
    typedef long long ll;
    typedef long double ld;
    typedef unsigned long long ull;
    using P=pair<int,int>;
    const int INF=1001001001;
    const int mod=998244353;

    void solve(){
        int n,w;
        cin>>n>>w;
        vector<int>a(n);
        rep(i,n)cin>>a[i];
        vector<int>ok(1<<n);
        rep(s,1<<n){
            if(__builtin_popcount(s)==0){continue;}
            rep(k,1<<n){
                ll sum=0;
                rep(v,n){
                    if(s>>v&1){
                        if(k>>v&1){sum+=a[v]/2;}
                        else{sum+=a[v];}
                    }
                }
                if(sum==w){ok[s]|=1;}
            }
        }
        int ans=accumulate(ok.begin(),ok.end(),0);
        cout<<ans<<endl;
    } 
    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve(); 
        
        return 0;
    }