N,K = map(int,input().split())
lsA = list(map(int,input().split()))
lsA.sort()
# bitDP?
dp = [0]*(2**N)
dp[0] = K

for i in range(2**N):
    for j in range(N):
        if (1<<j & i) == 0:
            dp[i|(1<<j)] = max(dp[i|(1<<j)],dp[i] % lsA[j])

print(dp[-1])