from math import gcd
import sys
input = sys.stdin.readline


def divisor(n):
    divisors = []
    i = 1
    while i * i < n:
        if n % i == 0:
            divisors.append(i)
            divisors.append(n // i)
        i += 1
    if i * i == n:
        divisors.append(i)
    divisors.sort()
    return divisors


mod = 998244353
N, M = map(int, input().split())
A = list(map(int, input().split()))
lcm = 1
for x in A:
    lcm = lcm // gcd(lcm, x) * x
div = divisor(lcm)

val = [0] * len(div)
for i, d in enumerate(div):
    s = sum(map(lambda a: gcd(a, d), A))
    val[i] = pow(M, s, mod)

for i in range(len(div)):
    for j in range(i):
        if div[i] % div[j] == 0:
            val[i] = (val[i] - val[j]) % mod

ans = 0
for i, d in enumerate(div):
    ans = (ans + val[i] * pow(d, mod-2, mod)) % mod
print(ans)