#include <iostream>
#include <fstream>
using namespace std;
ifstream f("factoriale.in");
ofstream g("factoriale.out");
int n,k,prim[105],nr,x[105];bool ciur[105];
void ce()
{
    int i,j;
    prim[++nr]=2;
    for(i=3;i<=100;i+=2)
        if(ciur[i]==0)
    {
        prim[++nr]=i;
        for(j=i*2;j<=100;j+=i)
            ciur[j]=1;
    }
}
long long sol=1;
void solve()
{
    f>>n>>k; int i,a,j;
    for(i=1;i<=n;i++)
    {
        f>>a;
        for(j=1;j<=nr&&a>1;j++)while(a%prim[j]==0){x[j]++; a/=prim[j];}
    }
    for(i=1;i<=j;i++)
        if(x[i]%k!=0)sol*=(k-x[i]%k)*x[i];
    g<<sol;
}
int main()
{
    ce();solve();
    return 0;
}