#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000;
int main(){
  int N;
  long long L;
  cin >> N >> L;
  vector<int> W(N);
  for (int i = 0; i < N; i++){
    cin >> W[i];
  }
  vector<long long> dp(W[0], INF);
  dp[0] = 0;
  for (int i = 1; i < N; i++){
    priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> pq;
    for (int j = 0; j < W[0]; j++){
      pq.push(make_pair(dp[j], j));
    }
    while (!pq.empty()){
      long long x = pq.top().first;
      int v = pq.top().second;
      pq.pop();
      long long y = x + W[i];
      int w = (v + W[i]) % W[0];
      if (dp[w] > y){
        dp[w] = y;
        pq.push(make_pair(y, w));
      }
    }
  }
  long long ans = 0;
  for (int i = 0; i < W[0]; i++){
    if (dp[i] <= L){
      ans += (L - dp[i]) / W[0] + 1;
    }
  }
  cout << ans - 1 << endl;
}