#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair
#define MOD 1000000007

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

map<ll, ll> prime_factor(ll n) {
	map<ll,ll> res;
	for(ll i=2; i*i <= n; i++) {
		while(n%i == 0) {
			res[i]++;
			n /= i;
		}
	}

	if(n != 1) res[n] = 1;
	return res;
}

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

int main() {
	int n, k;
	cin >> n >> k;

	vector<int> v(n);
	map<int, vector<int> > m;
	rep(i, n) {
		cin >> v[i];
		map<ll, ll> ret = prime_factor(v[i]);
		map<ll, ll>::iterator it;
		for(it = ret.begin(); it != ret.end(); it++) {
			m[it->first].push_back(it->second);
		}
	}

	ll ans = 1;
	map<int, vector<int> >::iterator it;
	for(it = m.begin(); it != m.end(); it++) {
		sort(it->second.begin(), it->second.end(), greater<int>());

		int cnt = 0;
		rep(i, min(int(it->second.size()), k)) {
			cnt += it->second[i];
		}

		ans *= mod_pow(it->first, cnt);
		ans %= MOD;
	}

	cout << ans << endl;

	return 0;
}