#include <bits/stdc++.h>
#define REP(i, n)     for(int i = 0;i < n;i++)
#define REPR(i, n)    for(int i = n;i >= 0;i--)
#define FOR(i, m, n)  for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(),greater<int>());
#define ALL(X) (X).begin(),(X).end()
#define INF 99999999
#define M_PI 3.14159265358979323846
#define MOD 1000000007

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) os << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }


ll N,K;
vector<ll> A;
void input(){
  #ifdef __LOCAL
      fs::path p = __FILE__;
      fs::path input,output;
      input = output = p.parent_path();
      input += string("/input/") + string(p.stem()) + string(".txt");
      output += string("/output/") + string(p.stem()) + string(".txt");
      freopen(input.c_str(), "r", stdin);
      freopen(output.c_str(), "w", stdout);
  #endif

  fast_io();
  cin >> N >> K;
  A=fetch_vec<ll>(N);
}

vector< ll > divisor(ll n) {
  vector< ll > ret;
  for(ll i = 1; i * i <= n; i++) {
    if(n % i == 0) {
      ret.push_back(i);
      if(i * i != n) ret.push_back(n / i);
    }
  }
  sort(begin(ret), end(ret),greater<ll>());
  return (ret);
}

// 愚直に実装
bool Myisok(ll d){
  vector<ll> Aplus,Aminus;
  ll sum=0;
  for (int i = 0; i < N; i++)
  {
    ll a =A[i]%d;
    Aplus.push_back(d-a);
    Aminus.push_back(a);
    sum+=a;
  }
  DBG(Aplus)
  DBG(Aminus)
  if(sum%d) return false;
  bool fetch_plus=false;
  bool fetch_minus=false;
  ll steps=0;
  ll steps_p=0;
  ll steps_m=0;
  vector<ll> tmpAplus=Aplus,tmpAminus=Aminus;
  for (int i = 0; i < N; i++)
  {
    ll step = min(Aplus[i],Aminus[i]);
    if(step==Aplus[i]) {fetch_plus=true; steps_p+=step; tmpAminus[i]=0;}
    else {fetch_minus=true; steps_m+=step; tmpAplus[i]=0;}
    steps+=step;
  }
  // 最後だけはうまくいくように調整する。
  DBG(steps_p)
  DBG(steps_m)
  if(steps_p==steps_m) return (steps_p<=K);
  while(steps_p>steps_m){
    auto itr_mp = max_element(tmpAplus.begin(),tmpAplus.end());
    int i = itr_mp-tmpAplus.begin();
    tmpAplus[i] = 0;
    DBG(i)
    steps_p -= Aplus[i];
    steps_m += Aminus[i];
  }
  while(steps_p<steps_m){
    auto itr_mp = max_element(tmpAminus.begin(),tmpAminus.end());
    int i = itr_mp-tmpAminus.begin();
    tmpAminus[i] = 0;
    steps_p += Aplus[i];
    steps_m -= Aminus[i];
  }
  DBG(steps_p)
  DBG(steps_m)
  return (steps_p<=K);
}

bool isok(ll d){
  vector<ll> Ar;
  for (int i = 0; i < N; i++)
  {
    Ar.push_back(A[i]%d);
  }
  sort(Ar.begin(),Ar.end());
  vector<ll> ArS(N+1,0);
  ArS[0] = 0;
  for (int i = 0; i < N; i++)
  {
    ArS[i+1] = ArS[i] + Ar[i];
  }
  DBG(Ar)
  DBG(ArS)
  for (int i = 0; i <= N; i++)
  {
    ll mi = -(ArS[i]-ArS[0]);
    ll pp = (N-i)*d - (ArS[N] - ArS[i]);
    DBG(mi)
    DBG(pp)
    if((mi+pp)==0 && pp<=K) return true;
  }
  return false;
}

ll solve(){
  ll AS = accumulate(A.begin(),A.end(),0LL);
  vector<ll> ASdiv = divisor(AS);
  DBG(ASdiv)
  for(auto D:ASdiv){
    if(isok(D)){cout << D << endl; return 0;}
  }
  return 0;
}

int main()
{
  input();
  solve();
  return 0;
}


Measured memory_bytes: 256