// Starcraft 2 enjoyer //
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using namespace std;
#define LSOne(X) ((X) & -(X))
const int N = 41;
const int M = 20;
const int K = 19;
const int LG = 20;
const int INF = 2e9 + 5;
const int C = 26;
const int B = 1000;
const int MOD = 1e9 + 7;
int n, k;
long long m, a[N], dp[2][1 << M], ans;
vector<long long> v;
inline void solve()
{
cin >> n >> m;
for (int x = 0; x < n; x++)
{
cin >> a[x];
}
k = min(n, M);
dp[0][0] = 0;
for (int x = 1; x < (1 << k); x++)
{
for (int y = 0; y < k; y++)
{
if (x >> y & 1)
{
dp[0][x] = dp[0][x ^ (1 << y)] + a[y];
break;
}
}
}
for (int x = 1; x < (1 << (n - k)); x++)
{
for (int y = 0; y < (n - k); y++)
{
if (x >> y & 1)
{
dp[1][x] = dp[1][x ^ (1 << y)] + a[y + k];
break;
}
}
}
for (int x = 0; x < (1 << (n - k)); x++)
{
v.push_back(dp[1][x]);
}
sort(v.begin(), v.end());
ans = 0;
for (int x = 0; x < (1 << k); x++)
{
ans += lower_bound(v.begin(), v.end(), m - dp[0][x] + 1) - v.begin();
}
cout << ans << "\n";
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
for (int x = 1; x <= t; x++)
{
solve();
}
return 0;
}
