#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define ll long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define repl(i,a,b) for(ll i=(a);i<(b);i++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()

template <typename T> bool chmin(T &a,T b){if(a>b){a=b;return true;} return false;}
template <typename T> bool chmax(T &a,T b){if(a<b){a=b;return true;} return false;}


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

  int n;
  ll k;
  cin >> n >> k;
  vector<int> a(n),b(n);
  rep(i,0,n) cin >> a[i];
  rep(i,0,n) cin >> b[i];
  int MAX=100001;
  vector<vector<int>> div(MAX);
  rep(p,1,MAX){
    for(int q=p;q<MAX;q+=p){
      div[q].push_back(p);
    }
  }
  rep(i,1,MAX) sort(all(div[i]));
  ll ok=1,ng=MAX+10;
  ll INF=1e18;
  while(ng-ok>1){
    ll mid=(ok+ng)/2;
    ll cnt=0;
    rep(i,0,n){
      ll num=INF;
      rep(j,0,div[a[i]].size()){
        if(div[a[i]][j]>=mid){
          if(b[i]%div[a[i]][j] == 0) num=0;
          else chmin(num,(ll)(div[a[i]][j]-b[i]%div[a[i]][j]));
        }
      }
      if(num == INF){
        cnt=INF;
        break;
      }
      else cnt+=num;
    }
    if(cnt<=k) ok=mid;
    else ng=mid;
  }
  cout << ok << '\n';
}