#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>

using namespace std;
using ll = long long;


map<ll, ll> solve(vector<ll> a, const ll &s) {
    int n = a.size();
    // dp[i][j]: 0,a0~a_iからjを作る方法は何通りか
    vector<map<ll, ll>> dp(n + 1);
    dp[0][0] = 1;
    for (int i = 0; i < n; ++i) {
        auto x = a[i];
        while (a[i] <= s) {
            for (const auto &[k, v]: dp[i]) {
                if (k + a[i] <= s) dp[i + 1][k + a[i]] += v;
            }
            a[i] *= x;
        }
    }
    return dp[n]; // 中身はmapで(和, その場合の数)のペア
}

int main() {
    int n;
    ll s;
    cin >> n >> s;

    vector<ll> a, b;
    for (int i = 0; i < n; ++i) {
        int t;
        cin >> t;
        if (i < n / 2) {
            a.emplace_back(t);
        } else {
            b.emplace_back(t);
        }
    }

    auto c = solve(a, s);
    auto d = solve(b, s);

    // dの第2成分の累積和を計算
    for (auto i = d.begin(); i != d.end() and next(i) != d.end(); ++i) {
        next(i)->second += i->second;
    }

    ll ans = 0;
    for (const auto &[k, v]: c) {
        auto it = d.upper_bound(s - k);
        if (it == d.begin()) continue;
        else ans += prev(it)->second * v;
    }
    cout << ans << endl;
    return 0;
}