#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1010;
int n,m;
int a[N],ans=0;
map<int,int>mp;
void dfs(int u,int res,int f){
    if(u>n){
        if(res==m){
            if(!mp.count(f)&&f){
                mp[f]=1;
                ans++;
            }
        }
        return ;
    }
    dfs(u+1,res+a[u],f+(1<<u));
    dfs(u+1,res+a[u]/2,f+(1<<u));
    dfs(u+1,res,f);
}
signed main(){
    cin>>n>>m;
    assert(n>=1&&n<=13);
    assert(m>=0&&m<=1e9);
    for(int i=1;i<=n;i++){
        cin>>a[i];
        assert(a[i]>=0&&a[i]<=1e9);
    }
    dfs(1,0,0);
    cout<<ans;
    return 0;
}