#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; ll l; cin >> n >> l;
  vector<int> w(n); REP(i, n) cin >> w[i];
  sort(ALL(w));
  const int m = w.back();
  vector<ll> dist(m, LINF);
  priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> que;
  REP(i, n) {
    dist[w[i] % m] = w[i];
    que.emplace(w[i], w[i] % m);
  }
  while (!que.empty()) {
    const auto [d, node] = que.top(); que.pop();
    if (d > dist[node]) continue;
    REP(i, n) {
      const int dst = (node + w[i]) % m;
      if (chmin(dist[dst], dist[node] + w[i])) que.emplace(dist[dst], dst);
    }
  }
  ll ans = l + 1;
  REP(i, m) ans -= min(dist[i] / m, l / m + (l % m >= i));
  cout << ans << '\n';
  return 0;
}