#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) (c).begin(),(c).end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MINF(a) memset(a,0x3f,sizeof(a))
#define POW(n) (1LL<<(n))
#define IN(i,a,b) (a <= i && i <= b)
using namespace std;
template <typename T> inline bool CHMIN(T& a,T b) { if(a>b) { a=b; return 1; } return 0; }
template <typename T> inline bool CHMAX(T& a,T b) { if(a<b) { a=b; return 1; } return 0; }
template <typename T> inline void SORT(T& a) { sort(ALL(a)); }
template <typename T> inline void REV(T& a) { reverse(ALL(a)); }
template <typename T> inline void UNI(T& a) { sort(ALL(a)); a.erase(unique(ALL(a)),a.end()); }
template <typename T> inline T LB(vector<T>& v, T a) { return *lower_bound(ALL(v),a); }
template <typename T> inline int LBP(vector<T>& v, T a) { return lower_bound(ALL(v),a) - v.begin(); }
template <typename T> inline T UB(vector<T>& v, T a) { return *upper_bound(ALL(v),a); }
template <typename T> inline int UBP(vector<T>& v, T a) { return upper_bound(ALL(v),a) - v.begin(); }
template <typename T1, typename T2> ostream& operator<< (ostream& os, const pair<T1,T2>& p) { os << p.first << " " << p.second; return os; }
template <typename T1, typename T2> istream& operator>> (istream& is, pair<T1,T2>& p) { is >> p.first >> p.second; return is; }
template <typename T> ostream& operator<< (ostream& os, const vector<T>& v) { REP(i,v.size()) { if (i) os << " "; os << v[i]; } return os; }
template <typename T> istream& operator>> (istream& is, vector<T>& v) { for(T& in : v) is >> in; return is; }
template <typename T = int> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...)); }
template <typename T, typename V> typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) { t = v; }
template <typename T, typename V> typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e,v); }
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-10;

int N,K;
int A[510];

bool check(int x) {
  vector<pii> ps;
  for (int i = 0; i < N; i++) {
    int R = (A[i] + x - 1) / x * x - A[i];
    int L = (x - R);
    if (R) ps.emplace_back(L, R);
  }
  if (ps.empty()) return true;
  SORT(ps);
  int neg = 0, pos = 0;
  for (int i = 0; i < ps.size(); i++) {
    pos += ps[i].second;
  }
  for (int i = 0; i < ps.size(); i++) {
    neg += ps[i].first;
    pos -= ps[i].second;
    if (neg == pos && pos <= K) return true;
  }
  return false;
}

vector<int> divisor(int n) {
  vector<int> r;
  for (int i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      r.push_back(i);
      if (i * i != n) r.push_back(n / i);
    }
  }
  return r;
}

signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);

  cin >> N >> K;
  REP(i,N) cin >> A[i];
  int sum = 0;
  REP(i,N) sum += A[i];
  vector<int> d = divisor(sum);
  SORT(d); REV(d);
  for (auto p : d) {
    if (check(p)) {
      cout << p << endl;
      return 0;
    }
  }
  cout << 1 << endl;
  
  return 0;
}

Measured memory_bytes: 256