#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define fore(i,a) for(auto i:a)
#define fore1(i,a) for(auto &i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second

using namespace std;
using namespace atcoder;

using ll = long long;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}}
#define dame { cout << "No" << endl; return 0;}
#define dame1 { cout << -1 << endl; return 0;}
#define test(x) cout << "test" << x << endl;
#define deb(x,y) cout << x << " " << y << endl;
#define out cout << ans << endl;
#define outv fore(yans , ans) cout << yans << endl;
#define show(x) cerr<<#x<<" = "<<x<<endl;
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << endl;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
using pii = pair<int,int>;
using tp = tuple<int ,int ,int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
using vpil = vector<pil>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;
using vvpli = vector<vector<pli>>;
using vvpll = vector<vpll>;
using vvpil = vector<vpil>;
using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;

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

    vl a(n);
    rep(i,n) cin>>a[i];

    vpll dp1,dp2;

    dp1.pb({0,1});
    dp2.pb({0,1});

    int m = n/2;

    rep(i,m){
        vpll tmp;

        swap(tmp , dp1);

        int l=0;

        rep(j,sz(tmp)){
            ll nxt = a[i];
            pll y = tmp[j];

            unordered_map<ll , ll> mp;

            if (y.fi + nxt > s) break;

            while(y.fi + nxt <= s){

                if (mp.count(y.fi + nxt)){
                    int k = mp[y.fi + nxt];
                    dp1[k].se += y.se;
                }else{
                    mp[y.fi + nxt] = l++;
                    // dp1.pb({y.fi + nxt , y.se});
                    dp1.pb({y.fi + nxt , 0});
                    dp1[l-1].se += y.se;
                }
                    
                nxt *= a[i];
            }
        }

        sort(rng(dp1));
    }

    repx(i,m,n){
        vpll tmp;

        swap(tmp , dp2);

        int l=0;

        rep(j,sz(tmp)){
            ll nxt = a[i];
            pll y = tmp[j];

            unordered_map<ll , ll> mp;

            if (y.fi + nxt > s) break;

            while(y.fi + nxt <= s){

                if (mp.count(y.fi + nxt)){
                    int k = mp[y.fi + nxt];
                    dp2[k].se += y.se;
                }else{
                    mp[y.fi + nxt] = l++;
                    
                    dp2.pb({y.fi + nxt , 0});
                    dp2[l-1].se += y.se;
                    
                }
                    
                nxt *= a[i];
            }
        }

        sort(rng(dp2));
    }

    ll ans=0;

    int l = sz(dp2);

    fenwick_tree<ll> ft(l);

    rep(i,l) ft.add(i , dp2[i].se); //deb(dp2[i].fi , dp2[i].se);}

    rep(i , sz(dp1)){
        pll p = make_pair(s - dp1[i].fi+1 , -1);
        int k = upper_bound(rng(dp2) , p) - dp2.begin();
        ans += ft.sum(0 , k);
    }

    out;

    return 0;
}