import sys,heapq
input = sys.stdin.buffer.readline
n,k=map(int,input().split())
A=[int(i) for i in input().split()]
DP=[0]*(2**n)
DP[0]=k
for i in range(2**n):
  for j in range(n):
    if not i&(1<<j):
      DP[i|(1<<j)]=max(DP[i|(1<<j)],DP[i]%A[j])
print(DP)