#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_multiset;
#define int long long
#define double long double
#define pb push_back
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define debug(x) cout << #x << " = " << x << '\n';
#define vdebug(a) cout << #a << " = "; for(auto x : a) cout << x << " "; cout << '\n';
const double eps = 1e-9;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
const int INF = 1e18;
signed main(){
fastio;
int n, m;
cin >> n >> m;
vector<int> v(n);
for(int i = 0; i < n; i++){
cin >> v[i];
}
vector<int> x;
int mid = (n + 1) / 2;
vector<int> a(v.begin(), v.begin() + mid);
for(int mask = 0; mask < (1LL << a.size()); mask++){
int s = 0;
for(int i = 0; i < a.size(); i++){
s += ((mask & (1LL << i)) ? a[i] : 0);
}
x.pb(s);
}
sort(x.begin(), x.end());
int ans = 0;
vector<int> b(v.begin() + mid, v.end());
for(int mask = 0; mask < (1LL << b.size()); mask++){
int s = 0;
for(int i = 0; i < b.size(); i++){
s += ((mask & (1LL << i)) ? b[i] : 0);
}
int cnt = upper_bound(x.begin(), x.end(), m - s) - x.begin();
ans += cnt;
}
cout << ans << '\n';
}
/*
freopen("x.in", "r", stdin);
freopen("x.out", "w", stdout);
*/
//atilla
