n, k = map(int, input().split())
A = list(map(int, input().split()))

if n == 1:
    print(k%A[0])
    exit()

A.sort(reverse=True)
min_a = A[-1]
A = A[:-1]
ans = -1
for i in range(2**(n-1)):
    temp = k
    for j in range(n-1):
        if (i >> j) & 1:
            temp %= A[j]
    temp %= min_a
    ans = max(temp, ans)
print(ans)