// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/cpglib/print.h>
#define debug(x...) _debug_print(0, #x, x);
#define Debug(x...) _debug_print(1, #x, x);
#define DEBUG(x...) _debug_print(2, #x, x);
std::ifstream terminal("/dev/tty");
#define PP cerr<<"\033[1;30mpause...\e[0m",terminal.ignore();
#else
#define debug(x...)
#define Debug(x...)
#define DEBUG(x...)
#define PP
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x),__VA_ARGS__})
#define cmax(x,...) x=max({(x),__VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define uint unsigned long long
#define endl "\n"
#define MAXN 200010
 
template<typename T> vector<pair<T, int>> getfreq(vector<T> &v, bool sorted = false) {
    if (!sorted) sort(v.begin(), v.end());
    vector<pair<T, int>> res;
    for (int i = 0, j = 0; i < (int)v.size(); i = j) {
        while (j < (int)v.size() && v[i] == v[j]) j++;
        res.emplace_back(v[i], j - i);
    }
    return res;
}
 
int bseq(vector<pair<int, int>> &a, int l, int r, int x) {
    while (l <= r) {
        int mid = l + (r-l) / 2;
        if (a[mid].first < x) l = mid + 1;
        else if (a[mid].first > x) r = mid - 1;
        else return mid;
    }
    return -1;
}
 
int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
 
    int n, m; cin >> n >> m;
    int na = n >> 1, nb = n - (n>>1);
    vector<int> a(na), b(nb), f;
    rep(i, 0, na) cin >> a[i];
    rep(i, 0, nb) cin >> b[i];
    rep(i, 0, 1<<na) {
        int sum = 0;
        rep(j, 0, na) if (i & (1<<j)) {
            sum += a[j];
            if (sum > m) break;
        }
        if (sum <= m) f.emplace_back(sum);
    }
    auto p = getfreq(f);
    int ans = 0;
    rep(i, 0, 1<<nb) {
        int sum = 0;
        rep(j, 0, nb) if (i & (1<<j)) {
            sum += b[j];
            if (sum > m) break;
        }
        if (sum <= m) {
            int idx = bseq(p, 0, sz(p)-1, m-sum);
            if (~idx) ans += p[idx].second;
        }
    }
    cout << ans << endl;
 
    return 0;
}