#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
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 U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

int main()
{
	ios_init();
	int n;
	LL k;
	while(cin >> n >> k) {
		vector<LL> a(n);
		REP(i, n) cin >> a[i];
		LL sum = 0;
		REP(i, n) {
			sum += a[i];
		}
		LL ans = 0;
		LL di = 1;
		while(di * di <= sum) {
			if(sum % di == 0) {
				// {
				// 	LL x = di;
				// 	auto b = a;
				// 	REP(i, n) b[i] %= x;
				// 	LL bs = 0;
				// 	REP(i, SZ(b)) bs += b[i];
				// 	if((bs - k + x - 1) / x <= n) {
				// 		chmax(ans, x);
				// 	}
				// 	chmax(ans, x);
				// }
				auto f = [&](LL x) {
					DEBUG(x);
					auto b = a;
					REP(i, n) b[i] %= x;
					LL bs = 0;
					REP(i, SZ(b)) bs += b[i];
					DEBUG(bs);
					LL l = bs / x;
					sort(ALL(b));
					DEBUG(l);
					dpite(ALL(b));
					LL y = 0;
					if(n - l < 0) return;
					REP(i, n - l) {
						y += b[i];
					}
					if(y <= k) chmax(ans, x);
					// REP(i, n + 1) {
					// 	DEBUG(i); DEBUG(max(bs - i * x, i * x));
					// 	if(max(bs - i * x, i * x) <= k){
					// 		chmax(ans, x);
					// 	}
					// 	DEBUG(ans);
					// }
				};
				f(di);
				f(sum / di);
			}
			di++;
		}
		cout << ans << endl;
	}
	return 0;
}


Measured memory_bytes: 256