import math
import sys
from itertools import accumulate

input = sys.stdin.readline

LIMIT = 10**5 + 10
INF = 10**12


def divisors(n):
    lower_divisors, upper_divisors = [], []
    i = 1
    while i * i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n // i)
        i += 1
    return lower_divisors + upper_divisors[::-1]


N, K = [int(s) for s in input().split()]
A = [int(s) for s in input().split()]
B = [int(s) for s in input().split()]

need_op = [[] for _ in range(N)]

for i, (a, b) in enumerate(zip(A, B)):
    op = []
    for div in divisors(a):
        op.append((div, (div - b) % div))

    min_cnt = INF

    for key, val in op[::-1]:
        min_cnt = min(val, min_cnt)
        need_op[i].append((key, min_cnt))
    need_op[i] = need_op[i][::-1]


imos = [0] * LIMIT
for i in range(N):
    for (curr, _), (to, val) in zip(need_op[i], need_op[i][1:]):
        imos[curr] += val
        imos[to] -= val

    imos[need_op[i][-1][0]] += INF

imos = [0] + list(accumulate(imos))

print(max(i for i in range(LIMIT) if imos[i] <= K))