#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;

int main(){
	int N, K;
	cin >> N >> K;

	map<int, vector<int>> primePowers;
	for(int i=0;i<N;i++){
		int a;
		cin >> a;
		for(int p=2;p*p<=a;p++)if(a % p == 0){
			int pp = 1;
			while(a % p == 0){
				a /= p;
				pp *= p;
			}
			primePowers[p].push_back(pp);
		}
		if(a != 1){
			primePowers[a].push_back(a);
		}
	}
	
	ll res = 1;
	for(auto ps : primePowers){
		auto powers = ps.second;
		sort(powers.rbegin(), powers.rend());
		for(int i=0;i<powers.size() && i<K;i++){
			res = (res * powers[i]) % MOD;
		}
	}
	cout << res << endl;
	return 0;
}