#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,N) for(int i=0;i<N;++i)
int N,w[20],d;
ll L,dp[1000000],ans;
bool vis[1000000];
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin>>N>>L;
  rep(i,N){
    cin>>w[i];
    d=gcd(d,w[i]);
  }
  L/=d;
  rep(i,N)w[i]/=d;
  sort(w,w+N);
  priority_queue<ll,vector<ll>,greater<ll>> que;
  que.emplace(0);
  while(!que.empty()){
    ll x=que.top();que.pop();
    int a=x%w[0];
    if(vis[a])continue;
    vis[a]=true;
    dp[a]=x;
    rep(i,N)if(!vis[(a+w[i])%w[0]])que.emplace(x+w[i]);
  }
  rep(i,w[0]){
    if(L<dp[i])continue;
    ans+=(L-dp[i])/w[0]+1;
  }
  cout<<ans-1<<'\n';
}