#include "bits/stdc++.h"
using namespace std;
#define rt return
#define FOR(i,j,k) for(int i=j; i<(int)k;++i)
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

unordered_map<ll, int> factorize(ll n){
    unordered_map<ll, int> res;
    for(ll i=2; i*i<=n; ++i){
        while(n%i==0){
            n /= i;
            ++res[i];
        }
    }
    if(n!=1) ++res[n];
    return res;
}
int powMod(int n, int k, int mod){
    ll res = 1 % mod, nn = n;
    while(k){
        if(k&1)res=res*nn%mod;
        nn=nn*nn%mod;
        k>>=1;
    }
    return (int)res;
}

const int N_MAX = 1001, MOD = (int)1e9 + 7;
unordered_map<ll, int> a[N_MAX];
map<ll, vi> cnt;
int N, K, A[N_MAX];
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> N >> K;
    rep(i, N)cin >> A[i], a[i] = factorize(A[i]);
    rep(i, N){
        each(p, a[i])cnt[p.first].push_back(p.second);
    }
    ll ans = 1;
    each(p, cnt){
        int cnt = 0;
        sort(all(p.second), greater<int>());
        rep(i, min(K, sz(p.second))){
            cnt += p.second[i];
        }
        ans *= powMod(p.first, cnt, MOD);
        ans %= MOD;
    }
    cout << ans << endl;
}