#include<bits/stdc++.h>
using namespace std;
const int MAXN = 50;
typedef long long ll;

ll a[MAXN],s1[MAXN],s2[MAXN],n,key,ans;
map<ll,int> hash;
inline void dfs(int x,int sum,int flag){
    if(!flag&&x>n/2){
        hash[sum]++;
        return;
    }
    if(flag&&x>n){
        ans+=hash[key-sum];
        return;
    }
    dfs(x+1,sum+a[x],flag);
    dfs(x+1,sum,flag);
}

inline void file(){
	freopen("password1.in","r",stdin);
	freopen("password1.out","w",stdout);
}

int main(){
	file();
    scanf("%lld%lld",&n,&key);
    for(int i=1;i<=n;i++)
    scanf("%lld",&a[i]);
    dfs(1,0,0);
    dfs(n/2+1,0,1);
    printf("%d",ans);
    return 0;
}