#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'


int main() {
  int n, k;
  cin >> n >> k;
  vi a(n);
  ll sum = 0;
  rep (i, n) {
    cin >> a[i];
    sum += a[i];
  }

  int ans = 1;
  vi kouho;
  for (int m = 1; m * m <= sum; m++) {
    if (sum % m == 0) {
      kouho.push_back(m);
      if (sum / m != m) {
        kouho.push_back(sum / m);
      }
    }
  }
  sort(all(kouho));
  UNIQUE(kouho);
  //DEBUG_VEC(kouho);
  rep (i, kouho.size()) {
    vi tas, hiku;
    int m = kouho[i];
    rep (j, n) {
      if (a[j] % m == 0) continue;
      tas.push_back((m - a[j] % m) % m);
      hiku.push_back(a[j] % m);
    }
    if (tas.size() == 0) {
      ans = m;
      continue;
    }

    sort(all(tas));
    sort(all(hiku));
    reverse(all(hiku));

    int nn = tas.size();
    vl tas_s(nn + 1), hiku_s(nn + 1);
    rep1 (i, nn) {
      tas_s[i] = tas_s[i - 1] + tas[i - 1];
      hiku_s[i] = hiku_s[i - 1] + hiku[i - 1];
    }
    //DEBUG_VEC(tas_s);
    //DEBUG_VEC(hiku_s);
    bool flag = false;
    rep (i, nn + 1) {
      if (tas_s[i] - tas_s[0] == hiku_s[nn] - hiku_s[i]) {
        //DEBUG(i);
        flag = true;
        int sousa = tas_s[i];
        if (sousa <= k) {
          //DEBUG(sousa);
          ans = m;
        }
        break;
      }
    }
    assert(flag);
  }
  cout << ans << endl;
}


Measured memory_bytes: 256