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

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main() {
  ll N, K;
  cin >> N >> K;
  vl A(N), B(N);
  const int MAX_A = 100005;
  fore(i, A) cin >> i;
  fore(i, B) cin >> i;
  vector<vi> divisor(MAX_A);
  rep(i, 2, MAX_A) { rep(j, i, MAX_A, i) divisor[j].push_back(i); }
  ll ok = 1, ng = *min_element(all(A)) + 1;
  vector<vi> cost(N);
  rep(i, N) {
    fore(d, divisor[A[i]]) { cost[i].push_back((d - B[i] % d) % d); }
  }

  while (ng - ok > 1) {
    ll mid = (ok + ng) / 2;
    ll s = 0;
    rep(i, N) {
      ll c = INFL;
      rep(j, sz(cost[i])) {
        if (divisor[A[i]][j] >= mid)
          chmin(c, cost[i][j]);
      }
      s += c;
      if (s > K)
        break;
    }
    if (s > K)
      ng = mid;
    else
      ok = mid;
  }
  cout << ok << '\n';
}