#include <bits/stdc++.h>
using namespace std;
template <typename G>
inline void read(G &x) {
  x = 0;
  char c;
  while (!isdigit(c = getchar()))
    ;
  do {
    x = x * 10 + c - '0';
  } while (isdigit(c = getchar()));
}
template <typename G>
inline void write(G x) {
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
template <class T>
inline T min(T a, T b, T c) {
  return min(a, min(b, c));
}
template <class T>
inline T min(T a, T b, T c, T d) {
  return min(a, min(b, c, d));
}
template <class T>
inline T max(T a, T b, T c) {
  return max(a, max(b, c));
}
template <class T>
inline T max(T a, T b, T c, T d) {
  return max(a, max(b, c, d));
}
const int MAXN = 1e6 * 7;
const int base = 1e9 + 7;
const int N = 5000;
int n;
int m;
int b[MAXN];
long long k, ans;
long long a[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  for (int i = (1); i <= (n); ++i) cin >> a[i];
  for (int i = (1); i <= (n); ++i) {
    int A = sqrt(a[i]) + 1;
    for (int d = (1); d <= (A); ++d) {
      b[++m] = (a[i] + d - 1) / d;
      b[++m] = d;
    }
    k += a[i];
  }
  sort(b + 1, b + m + 1);
  for (int i = (1); i <= (m); ++i)
    if (b[i] > b[i - 1]) {
      long long res = 0;
      for (int j = (1); j <= (n); ++j) {
        res += (a[j] + b[i] - 1) / b[i];
      }
      long long d = k / res;
      if (d >= b[i]) ans = max(ans, d);
    }
  cout << ans << '\n';
  return 0;
}
