#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

// template version 2.0
using namespace std;
#include <bits/stdc++.h>

// varibable settings
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T, class U> inline void chmax(T &a, const U &b) { if ((a) < (b)) (a) = (b); }
template <class T, class U> inline void chmin(T &a, const U &b) { if ((a) > (b)) (a) = (b); }
template <typename X, typename T> auto make_table(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector<decltype(cont)>(x, cont); }

template <class T> T cdiv(T a, T b){ assert(a >= 0 && b > 0); return (a+b-1)/b; }

#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x) sort(all(x)); x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;

template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
void check_input() { assert(cin.eof() == 0); int tmp; cin >> tmp; assert(cin.eof() == 1); }

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template<class T=ll> using vec = vector<T>;
struct Fast { Fast() { std::cin.tie(0); ios::sync_with_stdio(false); } } fast;


int solve() {
    int n;cin>>n;
    ll x;cin>>x;
    dump(n, x);
    vector<ll> a(n+1);
    rep(i, 1, n+1) { cin>>a[i]; }
    dump(a);

    vec<ll> d(n+1);
    rep(i, 1, n){
        d[i] = a[i+1] / a[i];
    }
    dump(d);

    vec<ll> xb(n+1);
    r_rep(i, 1, n+1){
        xb[i] = x / a[i];
        x %= a[i];
    }
    dump(xb);
    dump(x);

    vec<ll> dp0(n+1);
    vec<ll> dp1(n+1);
    dp0[0] = 1;
    rep(i, 0, n){ // kubaru
        // o[i+1]は[0, d[i+1])をとる

        // from dp0
        dp0[i+1] += dp0[i]; // take 0;
        if (xb[i+1]>=1){
            dp1[i+1] += dp0[i]; // take [d-xb, d)
        }

        // from dp1
        if (xb[i+1]+1 == d[i+1]){
            dp1[i+1] += dp1[i]; // take 0;
        }
        else{
            dp0[i+1] += dp1[i]; // take 0;
            dp1[i+1] += dp1[i]; // take [d-xb, d)
        }
    }
    dump(dp0);
    dump(dp1);
    cout << dp0[n] << endl;

    return 0; 
}


int main(){/*{{{*/
    solve();

    #if defined(PCM) || defined(LOCAL)
    check_input();
    #endif

    return 0;
}/*}}}*/

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> iint;
typedef pair<ll,ll> llll;
#define ALL(x) (x).begin(),(x).end()
const ll zero = 0;
const ll one = 1;
const ll INF = 9223372036854775807; //10^18
const int inINF = 2147483647; //10^9
const ll MOD = 1000000007; //10^9+7
const ll MOD2 = 998244353;
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}

ll N, X;
map<pair<ll, ll>, ll> memo;
vector<ll> A;

ll solve(ll Y, ll ind){
    if(memo.count({Y, ind})){
        return memo[{Y, ind}];
    }
    if(ind == N - 1){
        if(Y % A[ind] == 0){
            return 1;
        }
        else{
            return 0;
        }
    }
    ll low = Y / A[ind+1] * A[ind+1];
    ll up = Y / A[ind+1] * A[ind+1] + A[ind+1];
    ll ret = 0;
    ret += solve(low, ind+1);
    if(Y % A[ind+1] != 0){
        ret += solve(up, ind + 1);
    }
    return memo[{Y, ind}] = ret;
}


int main(){
    cin >> N >> X;
    A.resize(N);
    for (ll i = 0; i < N; i++) {
        cin >> A[i];
    }
    printf("%lld\n", solve(X, 0));


}