#pragma GCC target("avx2")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define ALL(x) (x).begin(), (x).end()
#define PC(x) __builtin_popcount(x)
#define PCL(x) __builtin_popcountll(x)

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
struct edge {
    int to, cost, id;
};
const double PI = 3.14159265358979323846;
const double PI2 = PI * 2.0;
const double EPS = 1E-09;
const ll MOD = 1E+09 + 7; // =998244353;
const ll INFL = 1E18;
const int INFI = 1E09;
const int MAX_N = 8;

ll dx[4] = { 0, -1, 0, 1 }, dy[4] = { 1, 0, -1, 0 };

int N;

ll S, A[MAX_N + 1];

void dfs1(int i, int lim, ll s, map<ll, ll>& mp)
{
    if (s > S)
        return;
    if (i == lim) {
        mp[s]++;
        return;
    }
    ll x = A[i + 1];
    for (int k = 1; k <= 29; ++k) {
        if (s + x > S)
            break;
        dfs1(i + 1, lim, s + x, mp);
        x *= A[i + 1];
    }
}

ll dfs2(int i, ll s, map<ll, ll>& sum)
{
    if (s > S)
        return 0;
    if (i == N) {
        auto it = sum.upper_bound(S - s);
        return prev(it)->second;
    }
    ll res = 0;
    ll x = A[i + 1];
    for (int k = 1; k <= 29; ++k) {
        if (s + x > S)
            break;
        res += dfs2(i + 1, s + x, sum);
        x *= A[i + 1];
    }
    return res;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> N >> S;

    for (int i = 1; i <= N; ++i) {
        cin >> A[i];
    }

    int offset = N / 2;
    map<ll, ll> mp, sum;
    dfs1(0, offset, 0, mp);
    sum[0] = 0;
    for (auto& [k, cnt] : mp) {
        sum[k] = 0;
    }
    auto it = sum.upper_bound(0);
    for (; it != sum.end(); ++it) {
        it->second = prev(it)->second;
        it->second += mp[it->first];
    }

    // for (int i = 0; i < N; i++) {
    //     for (int j = 0; j < N; j++) {
    //         cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n";
    //     }
    // }

    cout << dfs2(offset, 0, sum) << "\n";

    return 0;
}