#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
void solve(vl& v, vector<pll>& ans)
{
int n = siz(v);
map<ll,ll> ansm;
rep(mask,(1 << n))
{
ll sum = 0;
rep(i,n)
{
if((1 << i) & mask)
{
sum += v[i];
}
}
ansm[sum]++;
}
forall(it,ansm) ans.pb(it);
}
int main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//random_start();
int n;
ll bud;
cin >> n >> bud;
vl a((n+1)/2);
vl b(n-((n+1)/2));
rep(i,n)
{
if(i % 2 == 0) cin >> a[i/2];
else cin >> b[i/2];
}
vector<pll> va;
vector<pll> vb;
solve(a,va);
solve(b,vb);
ll ans = 0;
int b_ptr = siz(vb)-1;
ll sum = 0;
forall(it,vb) sum += it.ss;
forall(it,va)
{
while(b_ptr != -1 && it.ff+vb[b_ptr].ff > bud)
{
sum -= vb[b_ptr].ss;
b_ptr--;
}
ans += sum*it.ss;
}
cout << ans;
}
