import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))


N,K = MI()
A = LI()
A.sort(reverse=True)

ans = K % A[-1]
for i in range(1<<(N-1)):
    a = K
    for j in range(N-1):
        if (i>>j) & 1:
            a %= A[j]
    ans = max(ans,a % A[-1])

print(ans)