import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")

num = 4 * 10 ** 5
L = [1 for i in range(num)]; L[0] = 0; L[1] = 0
plist = []
for i in range(num):
	if L[i] == 1:
		plist.append(i); c = 2
		while i * c <= num - 1:
			L[i * c] = 0; c += 1

def prime_factorization(N):
	D = defaultdict(int)
	for i in plist:
		while N % i == 0:
			D[i] += 1; N = int(N // i)

	#num以上の素数が含まれているケースの処理
	if N != 1:
		D[N] += 1

	return D

def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	N, K = getlist()
	A = getlist()
	Dprime = defaultdict(list)
	for i in A:
		fac = prime_factorization(i)
		for key, value in fac.items():
			Dprime[key].append(value)

	for i in Dprime:
		Dprime[i].sort()

	ans = 1
	for i in Dprime:
		val = 0
		for j in range(min(K, len(Dprime[i]))):
			val += Dprime[i][-1 - j]

		ans = (ans * pow(i, val, con)) % con

	print(ans)



if __name__ == '__main__':
	main()