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

ans = 0
for bit in range(1 << (n - 1)):
    x = k
    for i in range(n - 1):
        if bit >> i & 1:
            x %= A[i]
    x %= A[-1]
    ans = max(ans, x)
print(ans)