#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;

const ll mod = 1000000007;

ll modpow(ll a, ll b, ll p = 1e9+7){
    if(b == 0)  return 1;

    if(b % 2 == 0){
        ll d = modpow(a, b/2, p);
        return (d*d) % p;
    }else{
        return (a%p * modpow(a, b-1, p)) % p;
    }
}

int main(){
    vector<int> p;
    bool nonp[100001] = {};
    nonp[0] = nonp[1] = true;
    for(int i = 2; i < 100001; i++){
        if(nonp[i]) continue;
        p.push_back(i);
        for(int j = i+i; j < 100001; j += i)    nonp[j] = true;
    }

    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for(int i = 0; i < n; i++)  cin >> a[i];

    ll ans = 1;
    // 素因数毎に独立に考える
    for(int prime : p){
        vector<int> num;
        for(int i = 0; i < n; i++){
            int cnt = 0;
            while(a[i]%prime == 0)  a[i] /= prime, cnt++;
            if(cnt) num.push_back(cnt);
        }
        sort(num.rbegin(), num.rend());
        ll sum = 0;
        for(int i = 0; i < min((int)num.size(), k); i++)    sum += num[i];
        ans *= modpow((ll)prime, sum, mod);
        ans %= mod;
    }
    
    for(int i = 0; i < n; i++){
        if(a[i] == 1)   continue;
        vector<int> num;
        ll prime = a[i];
        for(int j = i; j < n; j++){
            int cnt = 0;
            while(a[j]%prime == 0)  a[j] /= prime, cnt++;
            if(cnt) num.push_back(cnt);
        }
        sort(num.rbegin(), num.rend());
        ll sum = 0;
        for(int i = 0; i < min((int)num.size(), k); i++)    sum += num[i];
        ans *= modpow((ll)prime, sum, mod);
        ans %= mod;
    }

    cout << ans << endl;

    return 0;
}