#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
const double PI = 4 * atan(1);
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>
#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
void fast_io(){
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
}
void io(string taskname){
string fin = taskname + ".in";
string fout = taskname + ".out";
const char* FIN = fin.c_str();
const char* FOUT = fout.c_str();
freopen(FIN, "r", stdin);
freopen(FOUT, "w", stdout);
fast_io();
}
vector<ll> a;
int main(){
fast_io();
int n;
ll m;
vector<ll> f;
vector<ll> s;
cin >> n >> m;
int x = n/2;
int y = n-x;
f0r(i, n){
ll ai;
cin >> ai;
if(i<x){
f.eb(ai);
}
else s.eb(ai);
}
vector<ll> a;
vector<ll> b;
f0r(i, (1<<x)){
ll tmp = 0;
f0r(j, x){
if(((1<<j)& i)>0){
tmp += f[j];
}
}
a.eb(tmp);
}
f0r(i, (1<<y)){
ll tmp = 0;
f0r(j, y){
if(((1<<j)& i)>0){
tmp += s[j];
}
}
b.eb(tmp);
}
sort(all(a));
sort(all(b));
//cout << a << endl;
//cout << b << endl;
ll ptr = 0;
ll ans = 0;
for(int i = sz(a)-1; i>= 0; i--){
while(ptr +1<sz(b) && b[ptr+1] + a[i]<=m){
ptr++;
}
//cout << i << " " << ptr << endl;
if(b[ptr] + a[i] <= m)
ans += (ptr + 1);
}
cout << ans << endl;
return 0;
}
