#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define PB push_back
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define RBP(i,a) for(auto& i : a)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
#else
	#define DEBUG(x)
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
#define INF 1e8

typedef pair<int,int> P;
typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<LL,LL> LP;

void ios_init(){ ios::sync_with_stdio(false); cin.tie(0);	
	//cout.setf(ios::fixed);
	//cout.precision(12);
}

template<typename T>
unordered_map<T,int> PrimeFactorize(T x){
	unordered_map<T,int> res;
	for(T i = 2; i*i <= x; i++){
		while(x%i == 0){
			res[i]++;
			x /= i;
		}
	}
	if(x != 1) res[x]++;
	return res;
}

const LL mod = 1e9+7;

int main()
{
	ios_init();
	int n,k;
	cin >> n >> k;
	vector<LL> a(n);
	REP(i,n) cin >> a[i];
	unordered_map<LL,vector<int>> so;
	REP(i,n){
		auto res = PrimeFactorize(a[i]);
		RBP(x,res){
			so[x.F].push_back(x.S);
		}
	}
	LL ans = 1;
	RBP(x,so){
		sort(ALL(x.S),greater<int>());
		REP(i,min(k,SZ(x.S))){
			ans *= pow(x.F,x.S[i]);
			ans %= mod;
		}
	}
	cout << ans << endl;
	return 0;
}