from bisect import bisect_left 

INF = 10**9
n,k= map(int,input().split())
A = list(map(int,input().split()))

M = [0]*n
for i in range(n):
  M[i] = k % A[i]

M = sorted(M)
print(M[bisect_left(M,min(A))-1])