#include <bits/stdc++.h>

using namespace std;

const long long MOD = 1e9 + 7;

map<long long, int> factorize(long long n) {
  map<long long, int> ret;

  for (long long i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      ++ret[i];
      n /= i;
    }
  }

  if (n != 1)
    ret[n] = 1;

  return ret;
}

long long modpow(long long x, long long p, long long mod) {
  long long ret = 1;
  while (p) {
    if (p & 1)
      ret = ret * x % mod;
    x = x * x % mod;
    p >>= 1;
  }
  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n, k;
  cin >> n >> k;

  map<int, vector<int> > base; 
  for (int i = 0; i < n; i++) {
    long long a;
    cin >> a;
    auto fs = factorize(a);
    for (auto &[p, v]: fs) {
      base[p].push_back(v);
    }
  }

  long long ret = 1;
  for (auto &[p, v]: base) {
    sort(v.begin(), v.end());
    int sum = 0;
    for (int i = 0; i < min<int>(v.size(), k); i++)
      sum += v[v.size() - 1 - i];
    ret *= modpow(p, sum, MOD);
    ret %= MOD;
  }

  cout << ret << endl;
  
  return 0;
}