/* -*- coding: utf-8 -*-
 *
 * 368.cc: No.368 LCM of K-products - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 1000;
const int MAX_K = 1000;
const int MAX_P = 31623; // >=sqrt(10^9)

typedef long long ll;
const ll MOD = 1000000007;

/* typedef */

typedef vector<int> vi;

/* global variables */

bool primes[MAX_P + 1];
int as[MAX_N];

/* subroutines */

void gen_primes(int maxp, vi &pnums) {
  memset(primes, true, sizeof(primes));
  primes[0] = primes[1] = false;

  int p;
  for (p = 2; p * p <= maxp; p++)
    if (primes[p]) {
      pnums.push_back(p);
      for (int q = p * p; q <= maxp; q += p) primes[q] = false;
    }
  for (; p <= maxp; p++)
    if (primes[p]) pnums.push_back(p);
}

ll powmod(ll a, int b) {
  ll pm = 1;
  while (b > 0) {
    if ((b & 1) != 0) pm = (pm * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return pm;
}

/* main */

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

  int maxa = 0;
  for (int i = 0; i < n; i++) {
    cin >> as[i];
    if (maxa < as[i]) maxa = as[i];
  }

  vi pnums;
  int maxp = (int)(sqrt((double)maxa) + 1);
  //printf("maxa=%d, maxp=%d\n", maxa, maxp);
  gen_primes(maxp, pnums);

  int pn = pnums.size();
  ll lcm = 1;

  for (int i = 0; i < pn; i++) {
    int &pi = pnums[i];
    vi es(n, 0);

    for (int j = 0; j < n; j++)
      while (as[j] % pi == 0) {
	es[j]++;
	as[j] /= pi;
      }
    sort(es.begin(), es.end(), greater<int>());

    int esum = 0;
    for (int j = 0; j < k; j++) esum += es[j];

    lcm = lcm * powmod((ll)pi, esum) % MOD;
  }
  for (int i = 0; i < n; i++)
    lcm = (lcm * as[i]) % MOD;

  printf("%lld\n", lcm);
  return 0;
}