#include <bits/stdc++.h>
// #ifndef ONLINE_JUDGE
// #include <debug.h>
// #else
// #define debug(...)
// #endif
#define GOOD_LUCK ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(v) v.begin(), v.end()
using namespace std;
constexpr int MAX = 2e+5 + 1, INF = 2e+16, MOD = 1e+9 + 7, K = 31;
void _() {
int n, m;
cin >> n >> m;
vector <int> v(n);
for (int &i : v) cin >> i;
vector <int> a, b;
for (int i = 0; i < min(n, 20LL); i++) a.pb(v[i]);
for (int i = min(n, 20LL); i < n; i++) b.pb(v[i]);
vector <int>x, y;
for (int mask = 0; mask < (1 << a.size()); mask++) {
int s = 0;
for (int i= 0; i < a.size(); i++) {
if ((1 << i) & mask) s += a[i];
}
if (s <= m) x.pb(s);
}
for (int mask = 1; mask < (1 << b.size()); mask++) {
int s = 0;
for (int i = 0; i < b.size(); i++) {
if ((1 << i) & mask) s += b[i];
}
if (s <= m) y.pb(s);
}
sort(all(x));
sort(all(y));
int res = x.size() + y.size();
for (int &i : y) {
res += upper_bound(all(x), m - i) - x.begin();
}
cout << res;
}
signed main() {
GOOD_LUCK
int tests=1;
// cin >> tests;
for (int i=1; i <= tests; i++) {
_();
cout << endl;
}
return 0;
}
