#include <bits/stdc++.h>
using namespace std;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FORR(x,arr) for(auto&& x:arr)
#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 (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define BIT(n) (1LL<<(n))
#define SZ(x) ((int)(x).size())
typedef long long ll;
// -------------------------------------

int N, K;
int A[1000];

template <typename T>
map<T, int> factorize(T n) {
  map<T, int> ret;

  for (T i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      ++ret[i];
      n /= i;
    }
  }
  if (n != 1) ret[n] = 1;
  return ret;
}

map<int, vector<int>> G;
const long long mod = 1000000007;

long long powMod(long long x, long long y) {
  long long r = 1, a = x % mod;
  while (y) {
    if (y & 1) r = (r * a) % mod;
    a = (a * a) % mod;
    y /= 2;
  }
  return r;
}

void Main() {
  scanf("%d %d", &N, &K);
  REP(i, N) {
    int a;
    scanf("%d", &a);
    map<int, int>&& f = factorize(a);
    FORR(pc, f) {
      int p = pc.first;
      int c = pc.second;
      G[p].push_back(c);
    }
  }

  ll ans = 1;

  FORR(pv, G) {
    int p = pv.first;
    vector<int>& v = pv.second;
    int x = 0;
    sort(ALL(v), greater<int>());
    REP(i, min(K, SZ(v))) {
      x += v[i];
    }
    (ans *= powMod(p, x)) %= mod;
  }

  cout << ans << endl;
}
int main() { cin.tie(0); ios::sync_with_stdio(false); Main(); return 0; }