#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#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 all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<class T> void chmax(T& a, const T& b) { a = max(a, b); }
template<class T> void chmin(T& a, const T& b) { a = min(a, b); }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr int INF = 1001001001;
template <class T, int k = 2>
vector<int> kBFS(vector<vector<pair<int, T>>> g, int s = 0) {
  const int n = g.size();
  vector<int> dist(n, INF);
  deque<vector<int>> q(k);
  dist[s] = 0;
  q[0].emplace_back(s);
  for (int dist_cur = 0;;) {
    vector<int>& vs = q[0];
    while (!vs.empty()) {
      int u = vs.back();
      vs.pop_back();
      if (dist[u] != dist_cur) continue;
      for (auto [v, c] : g[u]) {
        int nd = dist_cur + c;
        if (nd < dist[v]) {
          dist[v] = nd;
          q[c].emplace_back(v);
        }
      }
    }
    for(int i = 1;; i++) {
      dist_cur++;
      vector<int> tmp = move(q.front());
      q.pop_front();
      q.emplace_back(move(tmp));
      if (!q[0].empty()) break;
      if (i == k - 1) return dist;
    }
  }
}

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  ll l;
  cin >> n >> l;
  VI w(n);
  rep(i, n) cin >> w[i];
  sort(all(w));
  const int m = w.back();
  w.pop_back();
  vector<vector<pair<int, bool>>> g(m);
  rep(u, m) for(int d: w) {
    int v = u + d;
    if (v < m) g[u].emplace_back(v, 0);
    else g[u].emplace_back(v - m, 1);
  }
  auto dist = kBFS(g);
  ll ans = 0;
  rep(i, m) {
    ll d = (ll)dist[i] * m + i;
    if (d > l) continue;
    ans += (l - d) / m + 1;
  }
  ans--;
  cout << ans << '\n';
}