#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,m,na,nb,w[45],ans;
vector<int>a,b;
void dfs1(int n,int s){
	if(n>na){a.push_back(s);return;}
	dfs1(n+1,s);
	dfs1(n+1,s+w[n]);
}
void dfs2(int n,int s){
	if(n>nb){b.push_back(s);return;}
	dfs2(n+1,s);
	dfs2(n+1,s+w[n+na]);
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>n>>m;
	na=n/2;
	nb=n-na;
	for(int i=1;i<=n;i++)	cin>>w[i];
	dfs1(1,0);
	dfs2(1,0);
	sort(a.begin(),a.end());
	for(int i=0;i<b.size();i++){
		ans+=upper_bound(a.begin(),a.end(),m-b[i])-a.begin();
	}
	cout<<ans;
	return 0;
}

https://www.luogu.com.cn/problem/P4799