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

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n, k; cin >> n >> k;
    vector<int> a(n); for (auto& i : a) cin >> i;
    
    int M = 1000000;
    vector<int> freq(M+1), cnt(M+1);
    for (auto& i : a) freq[i]++;
    for (int i=1; i<=M; i++) for (int j=i; j<=M; j+=i) cnt[i] += freq[j];

    vector<char> prime(M+1, true); prime[0] = prime[1] = false;
    for (long long i=2; i*i<=M; i++) if (prime[i]) {
        for (int j=i*i; j<=M; j+=i) {
            prime[j] = false;
        }
    }

    mint ans = 1;
    for (int i=2; i<=M; i++) if (prime[i]) {
        for (long long j=i; j<=M && n-n/k<cnt[j]; j*=i) {
            ans *= i;
            if (M/i < j) break;
        }
    }

    cout << ans.val() << '\n';
}