#include<bits/stdc++.h>
using namespace std;
long long n,key1,ans=0;
long long a[45],pre[45];
void dfs(long long x,long long w){
	if(w==key1){
		ans++;
		return;
	}
	if(x>n+1||w>key1||(w+pre[n]-pre[x-1]<key1)&&x-1<n){
		cout<<x<<" "<<w<<endl;
		return;
	}
	dfs(x+1,w+a[x]);
	dfs(x+1,w);
}
int main(){
	freopen("password1.in","r",stdin);
	freopen("password1.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>key1;
	memset(a,0,sizeof(a));
	for(int i=1;i<=n;i++){
		cin>>a[i];
		pre[i]+=pre[i-1]+a[i];
	}
	dfs(1,0);
	cout<<ans<<endl;
	return 0;
}