import sys
readline=sys.stdin.readline
import math
from collections import defaultdict

def Divisors(N):
    divisors=[]
    for i in range(1,N+1):
        if i**2>=N:
            break
        elif N%i==0:
            divisors.append(i)
    if i**2==N:
        divisors+=[i]+[N//i for i in divisors[::-1]]
    else:
        divisors+=[N//i for i in divisors[::-1]]
    return divisors

def Factorize(N):
    assert N>=1
    factors=defaultdict(int)
    for p in range(2,N):
        if p**2>N:
            break
        while N%p==0:
            factors[p]+=1
            N//=p
    if N!=1:
        factors[N]+=1
    return factors

def LCM(n,m):
    if n or m:
        return abs(n)*abs(m)//math.gcd(n,m)
    return 0

N,M=map(int,readline().split())
A=list(map(int,readline().split()))
mod=998244353
L=1
for a in A:
    L=LCM(L,a)
D=Divisors(L)
cnt=defaultdict(int)
for d in D:
    cnt[d]=L//d
for p in Factorize(L):
    for d in D:
        if d%p==0:
            cnt[d//p]-=cnt[d]
ans=0
for d,c in cnt.items():
    p=1
    for a in A:
        g=math.gcd(a,d)
        p*=pow(M,g,mod)
        p%=mod
    ans+=p*c
    ans%=mod
ans*=pow(L,mod-2,mod)
ans%=mod
print(ans)