#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
typedef long long ll;

ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9'){if(ss=='-')f=-1;ss=getchar();}
    while(ss>='0'&&ss<='9'){x=x*10+ss-'0';ss=getchar();}
    return x*f;
}

void print(ll x)
{
    if(x<0){putchar('-');x=-x;}
    if(x>9)print(x/10);
    putchar(x%10+'0');
}

ll n,k;
ll a[1000];
ll rem;
ll ans;

ll dfs(int d,int sum)
{
	if(d==n)
	{
		ll tp=0;
		if(sum+a[d]==k)tp++;
		if(sum==k)tp++;
		return tp;
	}
	
	ll tp=0;
	tp+=dfs(d+1,sum);
	tp+=dfs(d+1,sum+a[d]);
	
	return tp;
}

int main()
{
	freopen("password1.in","r",stdin);
	freopen("password1.out","w",stdout);
	
	n=read();k=read();
	for(int i=1;i<=n;i++)
	a[i]=read();
	
	ans=dfs(1,0);
	
	print(ans);
	fclose(stdin);
	fclose(stdout);
	
	return 0;
}