INF = 10**9
n,k= map(int,input().split())
A = list(map(int,input().split()))



def rec(s,v,dp,g):  
  if dp[s][v] >= 0:
    return dp[s][v]
  
  if s == (1<<n)-1 :
    dp[s][v] = k
    
    return k

  res = 0
  for u in range(n):
    if (s>>u & 1) == 0:
      res = max(res, rec(s|(1<<u),u,dp,g)%A[u])

  dp[s][v] = res
  return res

ans = 0
for i in range(n):
  s = 1<<i
  dp = [[-1]*n for i in range(1<<n)]
  ans = max(ans,rec(s,i,dp,i)) % A[i]
  
print(ans)