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

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