#include <iostream>
#include <set>
#include <map>
using namespace std;

typedef long long ll;

const ll kMOD = 1000 * 1000 * 1000 + 7;
const int kMAX_N = 1010;
const int kMAX_K = 1010;

int N, K;
set<ll> dp[kMAX_N][kMAX_K];
ll a[kMAX_N];

ll GCD(ll a, ll b) {
    if (b == 0) return a;
    else return GCD(b, a % b);
}

ll LCM(ll a, ll b) {
    return a * b / GCD(a, b);
}

void Solve() {
    dp[0][0].insert(1);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j <= K; j++) {
            if (dp[i][j].empty()) continue;
            for (set<ll>::iterator it = dp[i][j].begin(); it != dp[i][j].end(); it++) {
                dp[i + 1][j].insert(*it);
                if (j + 1 > K) continue;
                dp[i + 1][j + 1].insert((*it * a[i]) % kMOD);
            }
        }
    }
    ll answer = 1;
    for (set<ll>::iterator it = dp[N][K].begin(); it != dp[N][K].end(); it++) {
        answer = LCM(answer, *it);
        answer %= kMOD;
    }
    cout << answer << endl;
}

int main() {
    cin >> N >> K;

    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }

    Solve();

    return 0;
}