//@formatter:off
#include<bits/stdc++.h>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define rrep(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep2(i,s,n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

ll dp[60][2];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    ll X;
    cin >> n >> X;
    vl a(n);
    cin >> a;
    vl x(n);
    rrep(i, n) {
        x[i] = X / a[i];
        X %= a[i];
    }
    rrep(i, n - 1) {
        a[i + 1] /= a[i];
    }
    rep(i, n - 1) {
        a[i] = a[i + 1];
    }
    dp[0][0] = 1;
    rep(i, n - 1) rep(j, 2) {
            if (dp[i][j] == 0) continue;
            if (j + x[i] < a[i]) {
                dp[i + 1][0] += dp[i][j];
                if (j + x[i] > 0)dp[i + 1][1] += dp[i][j];
            } else {
                dp[i + 1][1] += dp[i][j];
            }
        }
    cout << dp[n - 1][0] + dp[n - 1][1] << endl;
}
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <sstream>
#include <numeric>
#include <map>
#include <vector>

using namespace std;

typedef long long LL;
map<pair<LL, LL>, LL> memo;

LL solve(LL x, LL i, const vector<LL> &a) {
	if (i >= a.size()) return 1;
	pair<LL, LL> key(x, i);
	if (memo.find(key) != memo.end()) return memo[key];
	LL w = 0;
	LL y = a[i];
	if (i == a.size() - 1) {
		return (x % y) == 0;
	}
	LL r = x % a[i + 1];
	if (r == 0) {
		w = solve(x, i + 1, a);
	} else {
		w = solve(x - r, i + 1, a) + solve(x - r + a[i + 1], i + 1, a);
	}
	memo[key] = w;
	return w;
}

int main() {
	LL N, X;
	cin >> N >> X;
	vector<LL> a(N);
	for (LL i = 0; i < N; ++i) {
		cin >> a[i];
	}
	LL ans = solve(X, 0, a);
	cout << ans << endl;
	return 0;
}
