#include<bits/stdc++.h>
using namespace std;
using ll=long long;

#include<atcoder/modint>
using namespace atcoder;
using mint=modint998244353;


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

    ll N,K;
    cin>>N>>K;
    vector<ll> A(N),B(N);
    for(int i=0;i<N;i++)cin>>A[i];
    for(int i=0;i<N;i++)cin>>B[i];

    vector<vector<ll>> Y(N);
    for(int i=0;i<N;i++){
        for(ll x=1;x*x<=A[i];x++){
            if(A[i]%x==0){
                Y[i].push_back(x);
                if(x*x!=A[i])Y[i].push_back(A[i]/x);
            }
        }
        sort(Y[i].begin(),Y[i].end());
        Y[i].push_back(1e18);
    }

    ll L=1,R=1e18;
    while(R-L>1){
        ll M=(R+L)/2;
        ll cnt=0;
        for(int i=0;i<N;i++){
            ll res=1e18;
            for(auto y:Y[i]){
                if(y<M)continue;
                ll nb=((B[i]+y-1)/y)*y;
                res=min(res,nb-B[i]);
            }
            cnt+=res;
            if(cnt>K)break;
        }
        if(cnt<=K)L=M;
        else R=M;
    }
    cout<<L<<"\n";
}