import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product

sys.set_int_max_str_digits(10 ** 6)
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353

input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(SMI())
EI = lambda m: [NLI() for _ in range(m)]


def main():
    N, M, K = NMI()
    A = NLI()
    P = [0] * (N+1)
    C = Counter(A)
    for a, k in C.items():
        for x in range(a, N+1, a):
            P[x] += k
    ans = 0
    for p in P:
        ans += (1 - pow((1 - p * pow(M, MOD99-2, MOD99)), K, MOD99)) % MOD99
    print(ans % MOD99)


if __name__ == "__main__":
    main()