n,k=map(int,input().split())
arr=list(map(int,input().split()))
vals=[[0]]
s=set()
s.add(0)
for i in range(1,n):
    tmp=[]
    for val in vals[-1]:
        for j in range(n):
            if val&(1<<j):
                continue
            if val+(1<<j) in s:
                continue
            tmp.append(val+(1<<j))
            s.add(val+(1<<j))
    vals.append(tmp)
v=[]
for i in range(n):
    for val in vals[i]:
        v.append(val)
v.append(2**n-1)
dp=[0]*(2**n)
dp[0]=k
for i in v:
    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])