import math
import sys
from itertools import accumulate

input = sys.stdin.readline

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


def factorize(n):
    factorized = []
    for i in range(1, math.isqrt(n) + 1):
        if n % i == 0:
            factorized.append(i)
            factorized.append(n // i)

    if math.isqrt(n) ** 2 == n:
        factorized.pop()

    return sorted(factorized)


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 fac in factorize(a):
        op.append((fac, (fac - b) % fac))

    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))