#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; ll s; in(n,s);
    vector<ll> a(n); in(a);
    int h = n/2;
    map<ll,ll> mp1[h+1], mp2[n-h+1];
    mp1[0][0] = 1;
    mp2[0][0] = 1;
    rep(i,h){
        for(auto [val,cnt] : mp1[i]){
            ll now = a[i];
            while(now+val <= s){
                mp1[i+1][now+val] += cnt;
                now *= a[i];
            }
        }
    }
    rep(i,n-h){
        for(auto [val,cnt] : mp2[i]){
            ll now = a[i+h];
            while(now+val <= s){
                mp2[i+1][now+val] += cnt;
                now *= a[i+h];
            }
        }
    }
    ll ans = 0;
    vector<ll> v1(mp1[h].size()), c1(mp1[h].size());
    vector<ll> v2(mp2[n-h].size()), c2(1+mp2[n-h].size());
    int idx = 0;
    for(auto [val,cnt] : mp1[h]){
        v1[idx] = val;
        c1[idx] = cnt;
        idx++;
    }
    idx = 0;
    for(auto [val,cnt] : mp2[n-h]){
        v2[idx] = val;
        c2[idx+1] = cnt;
        idx++;
    }
    rep(i,mp2[n-h].size()) c2[i+1] += c2[i];

    rep(i,mp1[h].size()){
        int idx = upper_bound(ALL(v2), s-v1[i]) - v2.begin();
        ans += c1[i] * c2[idx];
    }
    out(ans);
}