#include "bits/stdc++.h"
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
//#define INF (1LL<<59)

ll power(ll a,ll b/*,ll mod*/){
	ll ret=1;
	if(b>0){
		ret = power(a,b/2/*,mod*/);
		if(b%2==0)ret = (ret*ret)/*%mod*/;
		else ret = (((ret*ret)/*%mod*/)*a)/*%mod*/;
	}
	return ret;
}

map<int,int> prime_factorization(int n){
	map<int,int> ret;
	
	for(int div=2;div<=1+sqrt(n);div++){
		while(n%div==0){
			ret[div]++;
			n/=div;
		}
	}
	if(n!=1)ret[n]++;
	return ret;
}

int main(){
	map<int,vector<int>> mp;
	
	int n,k;
	cin>>n>>k;
	rep(i,n){
		int a;
		cin>>a;
		map<int,int> res = prime_factorization(a);
		for(auto &p : res){
			mp[p.first].pb(p.second);
		}
	}
	
	ll ans = 1;
	for(auto &elm : mp){
		sort(all(elm.second),greater<int>());
		rep(i,min<ll>(k,elm.second.size())){
			ans = (ans*power(elm.first,elm.second[i]))%1000000007;
		}
	}
	cout<<ans<<endl;
}