N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort(reverse=True)
dp=[K]
for bit in range(1,1<<N):
    for i in range(N-1,-1,-1):
        if bit&1<<i:
            dp.append(dp[bit^1<<i]%A[i])
            break
ans=max(dp[bit]for bit in range(1<<N) if bit&1<<N-1)
print(ans)