#include <stdio.h>
#include <math.h>
#include <string.h>
int prim[10005],v[10005],frecv[10005],k=0,aux[20005];
int a[20005];
void mul(int A[20000], int B[20000])
{
      int i, j, t, C[10000];
      memset(C, 0, sizeof(C));
      for (i = 1; i <= A[0]; i++)
      {
              for (t=0, j=1; j <= B[0] || t; j++, t/=10)
                      C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;
              if (i + j - 2 > C[0]) C[0] = i + j - 2;
      }
      memcpy(A, C, sizeof(C));
}
void inmul(int A[20000], int B)
{
      int i, t = 0;
      for (i = 1; i <= A[0] || t; i++, t /= 10)
              A[i] = (t += A[i] * B) % 10;
      A[0] = i - 1;
}

int main(){
	int i,j,x,p,n,ok=1,t;
	long long unsigned co;
	FILE*f=fopen("factoriale.in","r");
	FILE*g=fopen("factoriale.out","w");
	a[1]=1;
	a[0]=1;
	for(i=2;i<=100;i++)
		if(!v[i]){
			prim[++k]=i;
			for(j=i+i;j<=100;j+=i)
				v[j]=1;
		}
	fscanf(f,"%d%d",&n,&p);
	for (i=1;i<=n;i++){
		fscanf(f,"%d",&x);
		for(j=1;prim[j]<=x && j<=k;j++){
			co=prim[j];
			while(x/co){
				frecv[prim[j]]+=x/co;
				co=co*prim[j];
			}
		}
	}
	for(i=2;i<=100;i++)
		if(frecv[i] && frecv[i]%p){
			aux[0]=1;
			aux[1]=1;
			for(j=1;j<=p-(frecv[i]%p);j++)
				inmul(aux,i);
			mul(a,aux);
			for(j=1;j<=20000;j++) aux[i]=0;
		}
	for(i=a[0];i>=1;i--)
		fprintf(g,"%d",a[i]);
	return 0;	
}