#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <cmath>
#include <map>
#include <queue>

using namespace std;

const int MOD = 1e9 + 7;
const int A_MAX = 1e9;
const int A_MAX_ROOT = sqrt(A_MAX);

vector<int> make_primes() {
	vector<int> primes;
	vector<bool> is_prime(A_MAX_ROOT + 1, true);
	is_prime[0] = false;
	is_prime[1] = false;

	for (int i = 2; i * i <= A_MAX_ROOT; i++) {
		if (is_prime[i]) {
			for (int j = i * 2; j <= A_MAX_ROOT; j += i) {
				is_prime[j] = false;
			}
		}
	}

	for (int i = 2; i <= A_MAX_ROOT; i++) {
		if (is_prime[i]) {
			primes.emplace_back(i);
		}
	}
	return primes;
}

int main() {
	auto primes = make_primes();
	int n_primes = primes.size();

	int n, k, a;
	cin >> n >> k;
	map<int, priority_queue<int>> factors;
	for (int i = 0; i < n; i++) {
		cin >> a;
		for (int j = 0; j < n_primes; j++) {
			int n_factor = 0;
			while (a % primes[j] == 0) {
				a /= primes[j];
				n_factor++;
			}
			if (n_factor > 0) {
				factors[primes[j]].push(n_factor);
			}

			if (a == 1) {
				break;
			}
		}
		if (a != 1) {
			factors[a].push(1);
		}
	}

	long long ans = 1;
	for (auto ele : factors) {
		int x = ele.first;
		int y = 0;
		for (int i = 0; i < k; i++) {
			y += ele.second.top();
			ele.second.pop();
			if (ele.second.empty()) {
				break;
			}
		}
		// printf("%d, %d\n", ele.first, y);
		for (int i = 0; i < y; i++) {
			ans = ans * x % MOD;
		}
	}

	cout << ans << endl;
	return 0;
}