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

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rrep(i,n) for(int i=(int)(n-1);i>=0;i--)
#define ALL(v) v.begin(),v.end()
#define RALL(v) v.rbegin(),v.rend()
template <class T> using V=vector<T>;
template <class T> using VV=V<V<T>>;
using u128=__int128_t;
using ll=long long;

const ll INF=1e13;

vector<ll> divisor(ll x){
  set<ll> s;
  for(ll i=1;i*i<=x;i++){
    if(x%i==0){
      s.insert(i);
      s.insert(x/i);
    }
  }
  vector<ll> res;
  for(auto y:s) res.push_back(y);
  return res;
}
 
int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  VV<ll> C(100100);
  for(int i=1;i<100100;i++){
    auto a=divisor(i);
    sort(ALL(a));
    C[i]=a;
  }
  
  ll n,k;
  cin>>n>>k;
  V<ll> A(n),B(n);
  rep(i,n) cin>>A[i];
  rep(i,n) cin>>B[i];
  
  auto f=[&](int x)->bool{
    ll sum=0;
    rep(i,n){
      auto l=lower_bound(ALL(C[A[i]]),x)-C[A[i]].begin();
      if(l==C[A[i]].size()) return false;
      ll mi=INF;
      for(int j=l;j<C[A[i]].size();j++){
        ll a=C[A[i]][j];
        mi=min(mi,(B[i]+a-1)/a*a-B[i]);
      }
      sum+=mi;
    }
    if(sum<=k) return true;
    return false;
  };
  
  int ok=1,ng=100001;
  while(ng-ok>1){
    int mid=(ng+ok)/2;
    if(f(mid)) ok=mid;
    else ng=mid;
  }
  cout<<ok<<endl;
    
  return 0;
}