#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
int n,key,ans;
int a[45];
int b[45];
string s[1605];
void jin(int a,int i){
    while(a!=0){
        s[i]+=('0'+a%2);
        a/=2;
    }
}
int main(){
    freopen("password1.in","r",stdin);
    freopen("password1.out","w",stdout);
    cin>>n>>key;
    for(int i=1;i<=n;i++)cin>>a[i];
    for(int i=0;i<=pow(2,n)-1;i++){
        jin(i,i);
        int l=s[i].length();
        if(l<n){
            for(int t=1;t<=n-l;t++){
                s[i]+='0';
            }
        }
        reverse(s[i].begin(),s[i].end());
    }
    for(int i=0;i<=pow(2,n)-1;i++){
        int sum=0;
        for(int j=1;j<=n;j++){
            sum+=(s[i][j-1]-'0')*a[j]; 
        }
        if(sum==key)ans++;
    }
    cout<<ans<<endl;
    return 0;
}