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

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

for i in range(1<<N):
    for j in range(N):
        if i & (1<<j):
            dp[i] = max(dp[i], dp[i - (1<<j)]%A[j])
print(dp[-1])