#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
int n,cnt;
ll key,sum;
ll a[45];
void dfs(ll,int);
int main()
{
	freopen("password1.in","r",stdin);
	freopen("password1.out","w",stdout);
	scanf("%d%lld",&n,&key);
	for(int i = 1; i <= n; i++){
		scanf("%lld",&a[i]);
	}
	dfs(1,1);
	dfs(1,0);
	printf("%d",cnt);
	return 0;
}

void dfs(ll x,int y)
{
	ll tmp = a[x] * y;
	ll m = sum + tmp;
	if(x > n) return;
	if(sum + tmp > key) return;
	for(int i = x; i <= n; i++) m += a[i];
	if(m < key) return;
	if(sum + tmp < key) {
	 	sum += tmp;
	 	dfs(x + 1,0);	
		dfs(x + 1,1);
		sum -= tmp;
	}
	if(sum + tmp == key) {cnt++;return;}
	return;
}