#include<bits/stdc++.h>
    using namespace std;
    long long n,m,s,k,op;
    long long a[100];
    int main(){
        freopen("password1.in","r",stdin);
        freopen("password1.out","w",stdout);
         cin>>n>>k;
         op=pow(2,n)-1;
         for(int i=1;i<=n;i++){
             cin>>a[i];
         }
         for(int i=1;i<=op;i++){
             int x=i,y=0;
             for(int j=1;j<=n;j++){
                 y+=(x>>(j-1)&1)*a[j];
             }
             if(y==k){
                 s++;
             }
         }
         cout<<s;
         //极为朴素的算法，O(2^n*n) 
    }