/**
	author:  shobonvip
	created: 2024.11.16 19:38:14
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	ll n, m, k;
	cin >> n >> m >> k;

	vector<ll> a(m);
	vector<ll> t(n);
	rep(i,0,m){
		cin >> a[i];
		a[i] -= 1;
		if (a[i] < n) {
			t[a[i]] += 1;
		}
	}

	rrep(i,0,n) {
		for (int j=2*(i+1); j<=n; j+=i+1){
			t[j-1] += t[i];
		}
	}

	mint ans = 0;
	rep(i,0,n){
		if (t[i] > 0) {
			ans += mint(1) - (mint(m - t[i]) / mint(m)).pow(k);
		}
	} 
	cout << ans.val() << '\n';

}