#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint998244353;
//const int mod = 998244353;
//using mint = modint1000000007;
//const int mod = 1000000007;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
//約数列挙
std::vector<long long> DivisorEnumeration(long long n) {
	std::vector<long long> x;
	for (long long i = 1; i*i <= n; i++) {
		if (0 == n % i) {
			x.push_back(i);
			if (n != i * i) x.push_back(n / i);
		}
	}
	std::sort(x.begin(), x.end());
	return x;
}
void vectorMarge(vector<long long> &v0, vector<long long>&v1) {
	if (v0.size() < v1.size())swap(v0, v1);
	rep(i, v1.size()) {
		v0.push_back(v1[i]);
	}
}
pair<long long, long long>near(long long x, long long y) {
	long long r0 = (x / y)*y;
	long long r1 = ((x + y - 1) / y) * y;
	return { r0,r1 };
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<long long>a(n);
	rep(i, n)cin >> a[i];
	vector<long long>v;
	rep(i, n) {
		auto get = DivisorEnumeration(a[i]);
		vectorMarge(v, get);
	}
	std::sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	long long ans = 0;
	rep(i, v.size()) {
		long long sum = 0;
		rep(j, n) {
			auto get = near(a[j], v[i]);
			long long x = abs(a[j] - get.first);
			long long y = abs(a[j] - get.second);
			sum += min(x, y);
		}
		if (sum <= k)ans = v[i];
	}
	cout << ans << endl;
	return 0;
}