N, K = map(int, input().split())
A = list(map(int, input().split()))

dp = [0] * (1 << N)
dp[0] = K

for bit in range(1, 1 << N):
    for i, a in enumerate(A):
        if (bit >> i) & 1:
            bit_prev = bit ^ (1 << i)
            dp[bit] = max(dp[bit], dp[bit_prev] % a)
print(dp[(1 << N)-1])