#include <bits/stdc++.h>
using namespace std;

using ll = long long;
constexpr ll mod = 998244353;

int main() {
	int N, K;
	cin >> N >> K;
	
	vector<int> A(N);
	for(int i = 0; i < N; ++i) cin >> A[i];
	
	vector<vector<int>> v(1010101);
	for(auto a : A) {
		for(int i = 2; i * i <= a; ++i) {
			if(a % i) continue;
			v[i].push_back(0);
			while(a % i == 0) a /= i, v[i].back() += 1;
		}
		if(a != 1) v[a].push_back(1);
	}
	
	const int T = N - N / K + 1;
	ll ans = 1;
	for(int p = 2; p < 1010101; ++p) if(v[p].size() >= T) {
		sort(v[p].rbegin(), v[p].rend());
		for(int _ = 0; _ < v[p][T - 1]; ++_) ans = ans * p % mod;
	}
	
	cout << ans << "\n";
}