from collections import Counter
n,m,p = map(int,input().split())
f = [m]*(n+1)
c = Counter(map(int,input().split()))
for k,v in c.items():
    for r in range(1,n//k+1): f[k*r] -= v
x = 0; z = 998244353
for v in f[1:]: x += pow(v,p,z)
print((n-x*pow(m,-p,z))%z)