def rec(f, k, used, l):
	global Max
	if k == 0:
		Max = max(Max, f % m)
	else:
		for i in range(l + 1, n - k + 1):
			if not used[i]:
				used[i] = 1
				rec(f * s[i], k - 1, used, i)
				used[i] = 0
n, m = map(int, input().split())
s = list(map(int, input().split()))
Max = 0
for i in range(n):
	rec(1, i + 1, [0 for j in range(n)], -1)
print(Max)