class Eratosthenes:
    def __init__(self, n):
        self.isPrime = [True]*(n+1)
        self.minfactor = [-1]*(n+1)
        self.isPrime[0], self.isPrime[1] = False, False
        self.minfactor[1] = 1
        for i in range(2, n+1):
            if self.isPrime[i]:
                self.minfactor[i] = i
                for j in range(i*i, n+1, i):
                    self.isPrime[j] = False
                    if self.minfactor[j] == -1:
                        self.minfactor[j] = i
    
    def factorize(self, n):
        factor = []
        while n > 1:
            p = self.minfactor[n]
            cnt = 0
            while self.minfactor[n] == p:
                n //= p
                cnt += 1
            factor.append((p, cnt))
        return factor
    
    def divisor(self, n):
        ans = [1]
        pf = self.factorize(n)
        for p, c in pf:
            L = len(ans)
            for i in range(L):
                v = 1
                for _ in range(c):
                    v *= p
                    ans.append(ans[i]*v)
        return ans

MOD = 998244353

N, K = map(int, input().split())
A = sorted(map(int, input().split()))

E = Eratosthenes(10**6)
cnt = [[] for _ in range(10**6+1)]
for a in A:
    for n, c in E.factorize(a):
        cnt[n].append(c)
for i in range(10**6+1):
    cnt[i].sort()

ans = 1
for i in range(10**6+1):
    if N < len(cnt[i])+N//K:
        ans *= i**cnt[i][N//K-1-(N-len(cnt[i]))]
        ans %= MOD

print(ans)