#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<int> idx;

void _dfs(int N, int mi, int mx, vector<vector<int>> &A){
    if (idx.size() == N){
        A.push_back(idx);
        return;
    }
    else{
        for (int i = mi; i <= mx; i++){
            idx.push_back(i);
            _dfs(N, mi, mx, A);
            idx.pop_back();
        }
    }
}

//mi~mxのN重ループを返す。
vector<vector<int>> nested_loop(int N, int mi, int mx){
    vector<vector<int>> res;
    _dfs(N, mi, mx, res);
    return res;
}

int main(){

    ll N, S, x, l, r, sm, ans=0;
    cin >> N >> S;
    vector<ll> a(N), b(N);
    vector<vector<ll>> c(N, vector<ll>(30));
    for (int i=0; i<N; i++){
        cin >> a[i];
        x = 1;
        while (x * a[i] <= S){
            x *= a[i];
            b[i]++;
        }
        c[i][0] = 1;
        for (int j=1; j<=b[i]; j++) c[i][j] = c[i][j-1] * a[i];
    }

    l = (N+1)/2, r=N-l;
    vector<ll> w;
    vector<vector<int>> v = nested_loop(l, 1, 29);

    for (auto &vv : v){
        sm = 0;
        for (int i=0; i<l; i++){
            if (b[i] < vv[i]){
                sm = -1;
                break;
            }
            sm += c[i][vv[i]];
        }
        if (sm <= S && sm >= 0) w.push_back(sm);
    }
    sort(w.begin(), w.end());

    v = nested_loop(r, 1, 29);
    for (auto &vv : v){
        sm = 0;
        for (int i=0; i<r; i++){
            if (b[i+l] < vv[i]){
                sm = -1;
                break;
            }
            sm += c[i+l][vv[i]];
        }
        if (sm <= S && sm >= 0){
            ans += upper_bound(w.begin(), w.end(), S-sm) - w.begin();
        }
    }

    cout << ans << endl;

    return 0;
}