using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static long NN => long.Parse(ReadLine());
    static long[] NList => ReadLine().Split().Select(long.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m, k) = (c[0], c[1], c[2]);
        var a = NList;

        var count = new long[n + 1];
        foreach (var ai in a) if (ai <= n) ++count[ai];
        var val = new long[n + 1];
        for (var i = 1; i <= n; ++i)
        {
            if (count[i] > 0)
            {
                for (var j = i; j <= n; j += i) val[j] += count[i];
            }
        }
        var mod = 998_244_353;
        var ans = 0L;
        var rev = Exp(Exp(m, mod - 2, mod), k, mod);
        for (var i = 1; i <= n; ++i)
        {
            var sub = (1 + mod - Exp(m - val[i], k, mod) * rev % mod) % mod;
            ans = (ans + sub) % mod;
        }
        WriteLine(ans);
    }
    static long Exp(long n, long p, int mod)
    {
        long _n = n % mod;
        var _p = p;
        var result = 1L;
        if ((_p & 1) == 1) result *= _n;
        while (_p > 0)
        {
            _n = _n * _n % mod;
            _p >>= 1;
            if ((_p & 1) == 1) result = result * _n % mod;
        }
        return result;
    }
}