#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)
#define all(x) begin(x), end(x)
template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

using mint = atcoder::modint998244353;

void solve() {
	int n, k;
	cin >> n >> k;
	int m = 1e6 + 10;
	vector<int> a(m);
	rep(i, 0, n) {
		int x;
		cin >> x;
		a[x]++;
	}
	rep(i, 1, m) {
		for (int j = i * 2; j < m; j += i) {
			a[i] += a[j];
		}
	}

	if (k == 1) {
		mint ans = 1;
		vector<int> flg(m, 1);
		rep(i, 2, m) {
			if (!flg[i]) continue;
			int mx = 1;
			for (int j = i; j < m; j += i) flg[j] = 0;
			for (ll j = i; j < m; j *= i) {
				if (a[j] > 0) mx = j;
			}
			ans *= mx;
		}
		cout << ans.val() << '\n';
		return;
	}

	int ans = 0;
	rep(i, 0, m) if ((ll)(n - a[i] + 1) * (k - 1) < a[i]) ans = i;
	cout << ans << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	int t = 1;
	// cin >> t;
	while (t--) solve();
}