#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
typedef long long int ll;
using namespace std;
#define INF 1234567890
#define LIMIT 1
int arr[25];
int n, s;
int cnt = 0;
void dfs(int x, int sum) {
	if (x == n) {
		if (sum == s) {
			cnt++;
		}
		return;
	}
	dfs(x + 1, sum + arr[x]);
	dfs(x + 1, sum);
}


int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);


	cin >> n >> s;
	if (s == 0) cnt--;
	for (int i = 0; i < n; i++) {
		cin >> arr[i];
	}
	dfs(0, 0);
	
	cout << cnt;

	return 0;
}