#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
using namespace std;
const int PRIME = 100000;
const int NUM = 1005;
const int MOD = 1000000007;


int nPrime;
int prime[PRIME];

void makePrime() {
    bool isPrime[PRIME];
    for (int i = 0; i < PRIME; ++i) isPrime[i] = true;
    for (int i = 2; i * i < PRIME; ++i)
        if (isPrime[i])
            for (int j = i * 2; j < PRIME; j += i)
                isPrime[j] = false;
    nPrime = 0;
    for (int i = 2; i < PRIME; ++i)
        if (isPrime[i])
            prime[nPrime++] = i;
}


int nNum, nChoose;
int num[NUM];

void read() {
    cin >> nNum >> nChoose;
    for (int i = 0; i < nNum; ++i) {
        cin >> num[i];
    }
}


void addPrime2nFactor(int p, int nFactor, map<int, vector<int> > &prime2nFactor) {
    if (!prime2nFactor.count(p)) {
        prime2nFactor[p] = vector<int>();
    }
    prime2nFactor[p].push_back(nFactor);
}


int modpow(int p, int n) {
    if (n == 0) return 1;
    int t = modpow(p, n / 2);
    return n % 2 == 0 ? 1LL * t * t % MOD : 1LL * t * t % MOD * p % MOD;
}


void work() {
    map<int, vector<int> > prime2nFactor;
    
    for (int i = 0; i < nNum; ++i) {
        int n = num[i];
        
        for (int j = 0; prime[j] * prime[j] <= n; ++j) {
            if (n % prime[j] == 0) {
                int nFactor = 0;
                while (n % prime[j] == 0) {
                    n /= prime[j];
                    ++nFactor;
                }
                addPrime2nFactor(prime[j], nFactor, prime2nFactor);
            }
        }
        
        if (n > 1) {
            addPrime2nFactor(n, 1, prime2nFactor);
        }
    }

    int ans = 1;
    for (map<int, vector<int> >::iterator it = prime2nFactor.begin(); it != prime2nFactor.end(); ++it) {
        int prime = it->first;
        vector<int> &nFactor = it->second;

        sort(nFactor.rbegin(), nFactor.rend());

        for (int i = 0; i < min(nChoose, (int) nFactor.size()); ++i) {
            ans = (1LL * ans * modpow(prime, nFactor[i])) % MOD;
        }
    }
    
    cout << ans << endl;
}


int main() {
    makePrime();
    read();
    work();
    return 0;
}