#include<bits/stdc++.h>
#include<atcoder/all>
#define chmin(x,y) (x) = min((x),(y))
#define chmax(x,y) (x) = max((x),(y))
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vec vector
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back 
#define eb emplace_back

using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
const ll mod = 998244353;
using mint = modint998244353;
const vector<int> dx = {1,0,-1,0}, dy = {0,1,0,-1};
// using Graph = vector<vector<pair<int,ll>>>;
using Graph = vector<vector<int>>;

vector<int> divisors(int n){
  vector<int> res;
  for(int i = 1; i * i <= n; i++){
    if(n % i == 0){
      res.pb(i);
      if(i * i != n)
        res.pb(n / i);
    }
  }
  // sort(rall(res));
  sort(all(res));
  return res;
}

int main(){
  // input + prep
  int N; ll K;
  cin >> N >> K;
  vector<int> A(N),B(N);
  vector<vector<int>> D(N);
  rep(i,N){
    cin >> A[i];
    D[i] = divisors(A[i]);
  }
  rep(i,N) cin >> B[i];

  // prep
  vector<vector<int>> F(N);
  rep(i,N){
    int M = (int)D[i].size();
    vector<int> u(M), v(M);
    rep(j,M)
      u[j] = (B[i] % D[i][j] == 0 ? 0 : D[i][j] - B[i] % D[i][j]);
    rep(j,M)
      v[M-1-j] = (j > 0 ? min(v[M-j],u[M-1-j]) : u[M-1-j]);
    F[i] = v;
  }

  // solve
  int ok = 1, ng = 100001;
  while(ng - ok > 1){
    int mid = (ok + ng) / 2;
    bool can = 1;
    ll cnt = 0;

    rep(i,N){
      int pos = lower_bound(all(D[i]),mid) - D[i].begin();
      if(pos < D[i].size())
        cnt += F[i][pos];
      else
        can = 0;
    }

    if(cnt > K) can = 0;

    if(can) ok = mid;
    else ng = mid;
  }
  
  // output
  cout << ok << endl;
}