// (◕ᴗ◕✿)

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define srep(i, s, n) for (ll i = s; i < (n); i++)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
template<typename T> using vvv = vv<vc<T>>;
using vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;
using ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;
using ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;
using uint = unsigned int;
using ull = unsigned long long;
const ld pi = acos(-1.0);
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
// const ll mod = 1000000007;
const ll mod = 998244353;
inline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }

#define debug(var) do { cerr << #var << " :\n"; view(var); } while(0)
template<typename T>void view(const T& e) {cerr << e;}
template<typename T1, typename T2>void view(const pair<T1, T2>& p) {cerr << "{" << p.first << ", " << p.second << "}";}
template<typename T>void view(const vc<T>& v) {for (const auto& e : v) {view(e);cerr << " ";} cerr << endl;}
template<typename T>void view(const vv<T>& vv) {for (const auto& v : vv) {view(v);} cerr << endl;}
template<typename T>void view(const set<T>& s) {for (const auto& e : s) {view(e);cerr << " ";} cerr << endl;}
template<typename T>void view(const multiset<T>& s) {for (const auto& e : s) {view(e);cerr << " ";} cerr << endl;}
template<typename T>void view(const unordered_set<T>& s) {for (const auto& e : s) {view(e);cerr << " ";} cerr << endl;}
template<typename T1, typename T2>void view(const map<T1, T2>& mp){for (const auto& e : mp) {view(e);cerr << " ";} cerr << endl;}

void solve(){
    int N; ll K; cin >> N >> K;
    vi A(N); rep(i, N) cin >> A[i];
    vi B(N); rep(i, N) cin >> B[i];
    vvi plus(N);
    rep(i, N){
        B[i] %= A[i];
        for (int p = 1; p * p <= A[i]; p++) if (A[i] % p == 0){
            int cost = (p - B[i] % p) % p;
            if (cost) plus[i].emplace_back(cost);
            int q = A[i] / p;
            cost = (q - B[i] % q) % q;
            if (cost) plus[i].emplace_back(cost);
        }
        sort(all(plus[i]));
        plus[i].erase(unique(all(plus[i])), plus[i].end());
        for (int j = len(plus[i]) - 2; j >= 0; j--) plus[i][j + 1] = plus[i][j + 1] -= plus[i][j];
    }
    vi id(N, 0);
    priority_queue<pair<int, int>, vc<pair<int, int>>, greater<>> pq;
    rep(i, N) pq.push({gcd(A[i], B[i]), i});
    int ans = pq.top().first;
    while (true){
        auto &[g, i] = pq.top(); pq.pop();
        ans = max(ans, g);
        if (id[i] == len(plus[i]) || plus[i][id[i]] > K){
            cout << ans << endl;
            return;
        }
        B[i] += plus[i][id[i]];
        K -= plus[i][id[i]];
        id[i]++;
        pq.push({gcd(A[i], B[i]), i});
    }
}


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    // cin >> T;
    while (T--) solve();
}