#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll MOD = 1e9 + 7;

ll modpow(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;
}

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

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, K;
	cin >> N >> K;
	vector<int> a(N);
	for (int i = 0; i < N; i++) cin >> a[i];
	map<int, vector<int> > mp;
	for (int x : a) {
		map<int, int> tmp(prime_factor(x));
		for (auto p : tmp) {
			mp[p.first].push_back(p.second);
		}
	}

	ll ans = 1;
	for (auto p : mp) {
		ll sum = 0;
		sort(p.second.rbegin(), p.second.rend());
		for (int i = 0; i < min((int)p.second.size(), K); i++) {
			sum += p.second[i];
		}
		(ans *= modpow(p.first, sum)) %= MOD;
	}
	cout << ans << endl;
	return 0;
}