#include<bits/stdc++.h>
using namespace std;
int n,m,c[10005],ans,cnt;
void search(int step,int num)
{
	if(step==n+1)
	{
		if(num==m) ans++;
		return;
	}
	if(num>=m)
	return;
	search(step+1,num+c[step]);
	search(step+1,num);
}
int main(){
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++)
	scanf("%d",&c[i]);
	search(1,0);
	printf("%d\n",ans);
	return 0;
}