n, k = map(int, input().split())
*a, = map(int, input().split())
a.sort(reverse=True)

ans = 0
for i in range(2**(n-1)):
    x = k
    for j in range(n-1):
        if (i >> j) & 1:
            x %= a[j]
    ans = max(ans, x % a[-1])

print(ans)