#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define yes cout << "Yes" << "\n"
#define no cout << "No" << "\n"
#define pb push_back
#define F first
#define S second
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <int, int> pii;
typedef vector <pii> vii;
typedef vector <ll> vi;
template<typename T>
void read(vector<T>& v) {
for (auto &x : v) cin >> x;
}
template<typename T>
void print(const vector<T>& v) {
for (auto &x : v) cout << x << ' ';
cout << "\n";
}
const ll MAX = 1e6 + 5;
const ll MOD = 1e9 + 7;
void solve() {
ll n, m;
cin >> n >> m;
int n1 = n / 2;
int n2 = n - n1;
vi a(n);
read(a);
vi b;
for (ll mask = 0; mask < (1 << n1); mask++) {
ll cem = 0;
for (int i = 0; i < n1; i++) {
if ((1 << i) & mask) {
cem += a[i];
}
}
if (cem > m) {
continue;
}
b.pb(cem);
}
sort(all(b));
ll ans = 0;
for (ll mask = 0; mask < (1 << n2); mask++) {
ll cem = 0;
for (int i = 0; i < n2; i++) {
if ((1 << i) & mask) {
cem += a[i + n1];
}
}
if (cem > m) {
continue;
}
ans += upper_bound(all(b), m - cem) - b.begin();
}
cout << ans << "\n";
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
for (int i = 1; i <= t; i++) {
solve();
}
}
