import sys
input = sys.stdin.readline
N,K = map(int,input().split())
A = list(map(int,input().split()))
dp = [None] * (1<<N)
for i,a in enumerate(A):
    dp[1<<i] = K%a

def dfs(b):
    if dp[b] is not None:
        return dp[b]
    ret = 0
    for i,a in enumerate(A):
        if b&(1<<i)==0: continue
        ret = max(ret, dfs(b^(1<<i)) % a)
    dp[b] = ret
    return ret
print(dfs(2**N-1))