#include<bits/stdc++.h>
using namespace std;
long long n,key,a[40+5],ans,s[40+5],ss=0;
inline void dfs(long long k,long long sum){
	if(k==n+1){
		if(sum==key)ans++;
		return ;
	}
	if(sum>key)return ;
	if(sum+s[k]<key)return ;
	for(long long i=0;i<=1;++i)dfs(k+1,sum+a[k]*i);
	return ;
}
inline bool cmp(long long a,long long b){
	return a<b;
}
int main(){
	freopen("password1.in","r",stdin);
	freopen("password1.out","w",stdout);
	scanf("%lld%lld",&n,&key);
	
	for(int i=1;i<=n;++i)scanf("%lld",&a[i]),ss+=a[i];
	if(ss<key){
		printf("0");
		return 0;
	}
	
	sort(a+1,a+1+n,cmp);
	for(int i=n;i>=1;--i)s[i]=s[i+1]+a[i];
	dfs(1,0);
	printf("%lld",ans);
//	for(int i=1;i<=n;++i)printf("%lld ",s[i]);
	return 0;
}