#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll MOD = 1000000007;
ll power(const ll p, const int n)
{
    if (n == 0) {
        return 1;
    }
    if (n % 2 == 1) {
        return (power(p, n - 1) * p) % MOD;
    } else {
        const ll pp = power(p, n / 2);
        return (pp * pp) % MOD;
    }
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, K;
    cin >> N >> K;
    constexpr ll SQRT = 31623;
    vector<bool> isprime(SQRT, true);
    vector<ll> prime;
    for (ll i = 2; i < SQRT; i++) {
        if (isprime[i]) {
            for (ll j = 2; i * j < SQRT; j++) {
                isprime[i * j] = false;
            }
        }
    }
    for (ll i = 2; i < SQRT; i++) {
        if (isprime[i]) {
            prime.push_back(i);
        }
    }
    const int size = prime.size();
    vector<priority_queue<int, vector<int>, greater<int>>> ind(size);
    map<ll, int> rest;
    for (int i = 0; i < N; i++) {
        ll a;
        cin >> a;
        for (int j = 0; j < size; j++) {
            const ll p = prime[j];
            int cnt = 0;
            while (a % p == 0) {
                a /= p;
                cnt++;
            }
            ind[j].push(cnt);
            if (ind[j].size() == K + 1) {
                ind[j].pop();
            }
        }
        if (a > 1) {
            rest[a]++;
        }
    }

    ll ans = 1;
    for (int i = 0; i < size; i++) {
        int sum = 0;
        while (not ind[i].empty()) {
            sum += ind[i].top();
            ind[i].pop();
        }
        ans *= power(prime[i], sum);
        ans %= MOD;
    }
    for (const auto& e : rest) {
        ans *= power(e.first, min(K, e.second));
        ans %= MOD;
    }
    cout << ans << endl;

    return 0;
}