#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

void integerFactorization(int n, vector<int>& base, vector<int>& expo)
{
    base.clear();
    expo.clear();
    int a = 2;
    while(a * a <= n){
        int b = 0;
        while(n % a == 0){
            ++ b;
            n /= a;
        }
        if(b > 0){
            base.push_back(a);
            expo.push_back(b);
        }
        ++ a;
    }
    if(n > 1){
        base.push_back(n);
        expo.push_back(1);
    }
}

const int MOD = 1000000007;

int main()
{
    int n, k;
    cin >> n >> k;

    map<int, vector<int> > m;
    for(int i=0; i<n; ++i){
        int a;
        cin >> a;
        vector<int> base, expo;
        integerFactorization(a, base, expo);
        for(unsigned j=0; j<base.size(); ++j)
            m[base[j]].push_back(expo[j]);
    }

    long long ans = 1;
    for(const auto& p : m){
        int x = p.first;
        vector<int> v = p.second;
        sort(v.rbegin(), v.rend());

        int size = min(k, (int)v.size());
        for(int i=0; i<size; ++i){
            for(int j=0; j<v[i]; ++j){
                ans *= x;
                ans %= MOD;
            }
        }
    }
    cout << ans << endl;

    return 0;
}