from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

N, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

def div(num):
    ret = []
    i = 1
    while i*i <= num:
        if num%i == 0:
            ret.append(i)
            if i*i < num: ret.append(num//i)
        i += 1
    return ret

D = []
for i in range(N):
    D.append(div(A[i]))

def check(m):
    res = 0
    for i in range(N):
        mn = INF
        for d in D[i]:
            if d < m: continue
            if B[i]%d == 0:
                mn = 0
                break
            else:
                tmp = -(-B[i]//d)*d - B[i]
                if mn > tmp: mn = tmp
        res += mn
        if res > K: return False
    return True

l, r = 1, 10**5+1
while r-l > 1:
    m = (l+r)//2
    if check(m): l = m
    else: r = m
print(l)