#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const ll MOD = 1e9 + 7;

ll powmod(int x, int n) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % MOD;
        x = x * x % MOD;
        n >>= 1;
    }
    return res;
}

void add_memo(map<int, vector<int> >& memo, int x, int cnt) {
    if (memo.find(x) == memo.end()) {
        memo[x] = vector<int>();
    }
    memo[x].push_back(cnt);
}

int a[1005];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, K;
    cin >> N >> K;
    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }
    ll ans = 1;
    map<int, vector<int> > memo;
    for (int i = 0; i < N; i++) {
        for (int j = 2; j * j <= a[i]; j++) {
            int cnt = 0;
            while (a[i] % j == 0) {
                a[i] /= j;
                cnt++;
            }
            if (cnt == 0) continue;
            add_memo(memo, j, cnt);
        }
        if (a[i] != 1) add_memo(memo, a[i], 1);       
    }
    for (auto& p : memo) {
        sort(p.second.rbegin(), p.second.rend());
        int sum = 0, sz = min((int)p.second.size(), K);
        for (int i = 0; i < sz; i++) {
            sum += p.second[i];
        }
        (ans *= powmod(p.first, sum)) %= MOD;
    }
    cout << ans << endl;
    return 0;
}