#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <cmath>
#include <numeric>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
using namespace std;
typedef long long ll;

vector<int> sieve_of_eratosthenes(int n) { // enumerate primes in [2,n] with O(n log log n)
    vector<bool> is_prime(n+1, true);
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i*i <= n; ++i)
        if (is_prime[i])
            for (int k = i+i; k <= n; k += i)
                is_prime[k] = false;
    vector<int> primes;
    for (int i = 2; i <= n; ++i)
        if (is_prime[i])
            primes.push_back(i);
    return primes;
}
map<int,int> factors(int n, vector<int> const & primes) {
    map<int,int> result;
    for (int p : primes) {
        if (n < p * p) {
            result[n] += 1;
            break;
        }
        while (n % p == 0) {
            result[p] += 1;
            n /= p;
        }
    }
    return result;
}
ll powi(ll x, ll y, ll p) {
    x = (x % p + p) % p;
    ll z = 1;
    for (ll i = 1; i <= y; i <<= 1) {
        if (y & i) z = z * x % p;
        x = x * x % p;
    }
    return z;
}

const int mod = 1e9+7;
int main() {
    int n, k; cin >> n >> k;
    vector<int> xs(n); repeat (i,n) cin >> xs[i];
    int max_x = *max_element(xs.begin(), xs.end());
    vector<int> primes = sieve_of_eratosthenes(sqrt(max_x) + 1000);
    map<int,vector<int> > counts;
    for (int x : xs) {
        for (auto it : factors(x, primes)) {
            int p, cnt; tie(p, cnt) = it;
            counts[p].push_back(cnt);
        }
    }
    int ans = 1;
    for (auto it : counts) {
        int p; vector<int> cnts; tie(p, cnts) = it;
        int l = cnts.size();
        sort(cnts.rbegin(), cnts.rend());
        int cnt = accumulate(cnts.begin(), cnts.begin() + min(k, l), 0);
        ans = ans * powi(p, cnt, mod) % mod;
    }
    cout << ans << endl;
    return 0;
}