#include<iostream>
#include<vector>
#include<algorithm>

using namespace std;
using ll = long long;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll n,k;
    cin>>n>>k;
    vector<ll> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    vector<ll> use;
    for(int i = 0;i<n;i++){
        for(ll j = 1;j*j<=a[i];j++){
            if(a[i]%j!=0) continue;
            use.push_back(j);
            use.push_back(a[i]/j);
        }
    }
    ll ans = 0;
    for(int i = 0;i<use.size();i++){
        ll now = use[i];
        ll need = 0;
        for(int j = 0;j<n;j++){
            ll nk = a[j] / now;
            ll cnt = a[j] - nk * now;
            nk++;
            cnt = min(cnt,nk*now-a[j]);
            need += cnt;
        }
        if(need<=k) ans = max(ans,now);
    }
    cout<<ans<<endl;

}