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

template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string) s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) { res += ", "; }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) { res += static_cast<char>('0' + v[i]); }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) { res += ", "; }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")"; }
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) { return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")"; }
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << " " << to_string(H); debug_out(T...); }
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(false);

  int N;
  int64_t L;
  {
    cin >> N >> L;
  }

  vector<int> W(N); {
    for (int i = 0; i < N; ++i) { 
      cin >> W[i];
    }
    sort(W.begin(), W.end());
  }

  vector<int> cycles(W.back(), -1); {
    deque<int> dq;
    dq.push_back(0);
    cycles[0] = 0;
    while (dq.size()) {
      int u = dq.front();
      dq.pop_front();
      for (int w : W) {
        int cost = u + w >= W.back();
        int nxtu = u + w - cost * W.back();
        if (cycles[nxtu] == -1 || cycles[nxtu] > cycles[u] + cost) {
          cycles[nxtu] = cycles[u] + cost;
          if (cost) dq.push_back(nxtu);
          else dq.push_front(nxtu);
        }
      }
    }
  }

  int64_t ans = L / W.back();
  for (int mod = 1; mod < W.back(); ++mod) if (cycles[mod] != -1) {
    ans += max((int64_t) 0, L / W.back() + (L % W.back() >= mod) - cycles[mod]);
  }

  cout << ans << endl;
}