#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngl(chrono::steady_clock::now().time_since_epoch().count());
// #define int long long
// #define int unsigned long long
// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 45;
int n; ll m, arr[maxN];
vector<ll> gen(int l, int r) {
int sz = r - l + 1; vector<ll> ans;
for (int msk = 0; msk < (1 << sz); msk++) {
ll sum = 0;
for (int i = 0; i < sz; i++) {
if ((msk >> i) % 2 == 0) continue;
sum += arr[i + l];
} ans.pb(sum);
}
return ans;
}
void solve() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> arr[i];
vector<ll> v1 = gen(1, n / 2);
vector<ll> v2 = gen(n / 2 + 1, n);
ll ans = 0;
for (ll i : v1) {
if (i > m) break;
ans += upper_bound(all(v2), m - i) - v2.begin();
}
cout << ans;
}
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << '\n';
}
return 0;
}
