#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("HCN.INP");
ofstream fout("HCN.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
//using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 9;
const int mxn = 1e5 + 5, mxq = 2e5 + 5, sq = 200, mxv = 2e6 + 5;
const ll inf = 1e17 + 5;
//const int base= (1 << 18);
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n; ll m;
ll a[45];
vt<ll>two, one;
void solve(int l, int r, ll sm){
if(l > r){
if(r == n)two.pb(sm);
else one.pb(sm);
return;
}
solve(l + 1, r, sm + a[l]); solve(l + 1, r, sm);
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> m;
for(int i = 1; i <= n; i++)cin >> a[i];
int nn = n / 2;
solve(1, nn, 0); solve(nn + 1, n, 0);
sort(one.begin(), one.end()); sort(two.begin(), two.end());
ll ans = 0, r = 0;
for(int i = sz(one) - 1; i >= 0; i--){
while(r < sz(two) && two[r] + one[i] <= m)r++;
ans += r;
}
cout << ans;
return(0);
}
