#include <bits/stdc++.h>

using namespace std;

ifstream fin  ("factoriale.in");
ofstream fout ("factoriale.out");

int n, k, p;
int v[505], f[505], e[505], prime[505], rez[100005];

void inm (int A[], int b){
    int t = 0;
    for(int i=1; i<=A[0]; i++) {
        A[i] = A[i]*b + t;
        t = A[i]/10;
        A[i] %= 10;
    }
    while (t) {
        A[++A[0]] = t%10;
        t /= 10;
    }
}

int exp (int a, int b) {
    int pp, rez;
    rez = 0, pp = b;
    while (pp <= a) {
        rez += a/pp;
        pp *= b;
    }
    return rez;
}

int main(){
    fin >> n >> k;
    for (int i=1; i<=n; i++){
        fin >> v[i];
    }
    for (int i=2; i<=110; i++){
        if (f[i] == 0){
            prime[++p] = i;
            for (int j=2*i; j<=110; j+=i){
                f[j] = 1;
            }
        }
    }
    for (int i=1; i<=n; i++){
        for(int j=1; j<=p; j++){
            e[j] += exp (v[i], prime[j]);
        }
    }
    rez[0] = 1;
    rez[1] = 1;
    for (int i=1; i<=p; i++){
        if (e[i] == 0){
            break;
        }
        while (e[i]%k){
            inm (rez, prime[i]);
            e[i]++;
        }
    }
    for (int i=rez[0]; i>=1; i--){
        fout << rez[i];
    }
    return 0;
}