#include<bits/stdc++.h>
using namespace std;
#ifdef ONPC
#include"debug.h"
#else
#define debug(...) 42
#endif
#define endl '\n'
#define ll long long
#define pii pair<int,int>
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
const int mod = 1e9 + 7;
const int MAXN = 1e6 + 15;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
ll a[MAXN], n, m;
ll ans = 0;
vector<ll> b;
void solve(int idx, ll sum, bool typ){
if (typ == 0 && idx == n / 2){
b.pb(sum);
return;
}
if (typ == 1 && idx == n){
ans += upper_bound(all(b), m - sum) - b.begin();
return;
}
solve(idx + 1, sum, typ);
solve(idx + 1, sum + a[idx], typ);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++){
cin >> a[i];
}
solve(0, 0, 0);
sort(all(b));
solve(n / 2, 0, 1);
cout << ans << endl;
}
