#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define rep(i, n) for (int i=0;i<n;i++)

const ll mod=998244353;
ll modPow(ll a,ll n,ll p=mod) {
    ll res=1,k=a%mod;
    while(n){
        if(n%2==1)res=(res*k)%p;
        k=(k*k)%p;
        n/=2;
    }
    return res;
}

int main() {
    ll N,M,L=1,an=0;
    cin>>N>>M;
    vll A(N),P;
    rep(i,N){
	    cin>>A[i];
    	L=L/gcd(L,A[i])*A[i];
    }
    for(ll i=1;i*i<=L;i++)if(L%i==0){
        P.push_back(i);
        if(L!=i*i)P.push_back(L/i);
    }
    sort(P.begin(),P.end());
    ll n=P.size();
    vll R(n,1);
    unordered_map<ll,ll> powMg;

    rep(j,n)powMg[P[j]]=modPow(M,P[j]);
    rep(j,n)rep(i,N)R[j]=(R[j]*powMg[gcd(A[N-1-i],P[j])])%mod;
    rep(i,n)rep(j,i){
        if(P[i]%P[j]==0)R[i]-=R[j];
        R[i]%=mod;
    }

    rep(i,n)an=(an+(R[i]*modPow(P[i],mod-2))%mod)%mod;
    cout<<(an+mod)%mod<<endl;
}