n,k=map(int,input().split())
arr=list(map(int,input().split()))
dp=[0]*(2**n)
dp[0]=k
for i in range(2**n):
    for j in range(n):
        if i&(1<<j):
            continue
        dp[i+(1<<j)]=max(dp[i+(1<<j)],dp[i]%arr[j])
print(dp[-1])