def Map():
  return list(map(int,input().split()))
def make_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 = Map()
A = Map()
A.sort()
ans = 1
for i in range(N):
  a = A[i]
  D = make_divisors(a)
  for d in D:
    k = 0
    if d == 1:
      continue
    for j in range(N):
      if i == j:
        continue
      k += min(A[j]%d,(d-A[j])%d)
    if k <= K:
      ans = max(ans,d)
print(ans)