#include <bits/stdc++.h>
using namespace std;

const long long mod = 1e9 + 7;

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

long long modpow(long long a, long long b, long long mod) {
	long long result = 1;
	for (; b > 0; a = a * a % mod, b /= 2) if (b & 1) result = result * a % mod;
	return result;
}

int main() {
	map<long long, vector<long long>> mp;
	int n, K;
	cin >> n >> K;

	for (int i = 0; i < n; i++) {
		int a;
		cin >> a;
		for (auto p : primeFactors(a)) {
			mp[p.first].push_back(p.second);
		}

	}

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