10 2 5
1 1 1 2 2 2 2 2 2 2
 10 2 5
1 1 1 1 1 1 2 2 2 2
 3 3 2
1 3 1
 8 8 7
7 2 8 6 8 5 3 8
 7 7 5
2 6 3 6 3 5 1
 5 5 1
5 2 5 1 2
 6 6 6
5 6 5 3 4 2
 5 5 2
2 3 2 2 4
 3 3 3
1 1 1
 111 78 54
24 13 49 22 52 38 38 63 21 10 9 56 60 47 11 78 23 52 55 12 72 33 17 14 33 59 21 32 20 73 1 60 27 64 23 74 36 49 69 14 29 37 19 61 52 33 26 27 10 11 34 25 62 47 36 12 63 45 31 71 78 1 6 26 36 65 56 46 19 28 77 64 56 8 77 38 3 33 63 77 40 7 22 13 60 14 57 43 51 10 30 21 7 67 32 11 12 9 72 24 27 67 25 63 6 67 69 37 26 19 26
 10 2 5
1 1 1 1 1 1 1 1 1 2
 6 6 1
4 5 6 3 5 3
 10 2 5
1 1 1 1 2 2 2 2 2 2
 8 8 3
8 8 2 7 8 2 3 5
 7 7 4
4 6 6 7 2 5 3
 10 2 5
2 2 2 2 2 2 2 2 2 2
 111 67 97
32 67 4 15 17 17 23 6 39 54 19 62 28 59 63 36 44 40 28 67 28 3 55 19 11 26 3 38 22 26 62 54 61 15 22 4 47 53 27 36 31 5 16 59 51 62 51 46 7 55 26 66 50 51 32 17 54 14 18 14 40 30 24 2 61 16 16 27 55 58 35 7 26 3 26 4 13 59 14 32 56 54 5 46 39 30 45 24 37 12 67 38 45 32 41 21 46 26 41 29 15 28 65 5 19 53 13 31 58 18 57
 6 6 2
4 4 2 4 2 3
 10 2 5
1 1 1 1 1 2 2 2 2 2
 10 2 5
1 1 1 1 1 1 1 1 2 2
 6 6 4
5 2 4 3 1 5
 10 2 5
1 1 2 2 2 2 2 2 2 2
 1 1 1
1
 8 8 5
7 5 6 8 2 8 3 4
 10 2 5
1 1 1 1 1 1 1 2 2 2
 111 101 52
54 69 33 81 8 90 48 21 96 35 44 75 68 34 101 82 93 94 86 76 33 91 5 70 22 84 70 71 62 81 50 83 51 43 95 46 19 53 101 34 51 40 6 17 69 60 73 89 65 75 59 68 62 49 89 23 63 83 86 68 62 39 1 18 3 75 44 57 9 24 67 81 83 45 93 66 79 71 43 49 17 2 33 38 98 71 71 21 56 16 31 2 75 61 64 38 69 80 81 12 68 95 26 9 69 82 41 35 75 7 71
 3 3 3
3 3 1
 4 4 2
2 4 4 3
 10 2 5
1 2 2 2 2 2 2 2 2 2
 4 4 4
4 4 4 4
 3 3 2
1 2 3
 2 1 2
1 1
 5 5 3
3 4 1 5 5
 7 7 1
2 6 5 6 2 3 3
 111 9 57
9 9 2 6 8 6 5 8 9 7 3 9 1 2 6 6 5 3 1 1 6 1 8 4 3 9 8 6 8 1 9 8 5 8 6 9 4 5 7 3 1 6 4 3 2 5 7 3 1 7 9 1 7 1 3 5 9 5 6 2 2 7 9 7 1 5 5 5 5 2 6 5 7 3 8 9 7 3 6 5 1 9 2 9 9 8 8 7 9 1 6 2 4 5 7 4 8 9 9 2 7 7 6 9 8 2 1 3 3 1 5
 4 4 1
2 4 1 4
 2 1 1
1 1
 111 16 58
15 6 4 7 7 10 16 2 3 1 4 8 10 1 2 11 6 6 14 16 6 16 1 2 13 2 7 13 1 4 1 4 12 2 4 11 15 12 9 13 10 4 11 7 5 3 12 11 11 3 16 15 9 6 15 11 4 14 8 15 16 3 9 10 9 1 8 4 14 7 13 5 1 8 5 11 8 14 1 8 15 2 5 2 4 5 9 2 10 11 11 5 7 11 11 14 5 16 14 2 4 11 12 10 7 14 2 5 3 2 1
 2 2 2
1 1

4
 5
 2
 6
 12
 3
 1
 4
 1
 648
 2
 4
 5
 19
 25
 1
 214
 5
 6
 3
 11
 3
 1
 41
 4
 881
 1
 4
 2
 1
 3
 1
 7
 4
 446
 3
 1
 552
 1

#include <bits/stdc++.h>

typedef long long int64;
typedef unsigned int uint;
typedef unsigned long long uint64;

const uint MOD = 998244353, G = 3, I = 86583718, Inv2 = 499122177, Inv3 = 332748118, InvI = 911660635;
const int BRUTE_LIMIT = 100;

inline uint norm(const uint &x) {
	return x < MOD ? x : x - MOD;
}

struct Z {
	uint v;
	Z(const uint &v = 0) : v(v) {}
	inline bool operator < (const Z &x) const {
		return v < x.v;
	}
	inline Z operator + (const Z &rhs) const {
		return norm(v + rhs.v);
	}
	inline Z operator - (const Z &rhs) const {
		return norm(v + MOD - rhs.v);
	}
	inline Z operator - () const {
		return v == 0 ? 0 : MOD - v;
	}
	inline Z operator * (const Z &rhs) const {
		return static_cast<uint64>(v) * rhs.v % MOD;
	}
	inline Z &operator += (const Z &rhs) {
		return *this = this->operator+(rhs);
	}
	inline Z &operator -= (const Z &rhs) {
		return *this = this->operator-(rhs);
	}
	inline Z &operator *= (const Z &rhs) {
		return *this = this->operator*(rhs);
	}
	inline Z &operator ++ () {
		++v == MOD && (v = 0);
		return *this;
	}
	inline Z &operator -- () {
		v-- == 0 && (v = MOD - 1);
		return *this;
	}
};

inline Z power(Z x, int k) {
	Z ans = 1;
	for (; k > 0; k >>= 1, x *= x) {
		if (k & 1) {
			ans *= x;
		}
	}
	return ans;
}
inline Z inv(const Z &x) {
	return power(x, MOD - 2);
}
inline int ceilLog(const int &n) {
	return std::__lg((n << 1) - 1);
}
inline int bsgs(Z a, Z b) {
	if (b.v == 1) {
		return 0;
	}
	int m = ceil(sqrt(MOD));
	std::unordered_map<uint, int> map;
	Z w(1);
	for (int i = 0; i < m; i++, b *= a, w *= a) {
		map[b.v] = i;
	}
	a = w;
	for (int i = 1; i <= m; i++, a *= w) {
		if (map.count(a.v)) {
			return i * m - map[a.v];
		}
	}
	return -1;
}
inline Z degree(Z x, const int &k) {
	if (x.v == 0) {
		return 0;
	}
	int r = bsgs(G, x);
	assert(r >= 0 && r % k == 0);
	x = power(G, r / k);
	return std::min(x, -x);
}

namespace NTT {
	int K = 0;
	std::vector<Z> w[22];
	inline void prepare(const int &k) {
		for (; K < k; ) {
			K++;
			w[K].resize((1 << K) + 1, 0);
			Z root = ::power(G, (MOD - 1) >> K);
			w[K][0] = 1;
			for (int i = 1; i < (1 << K); i++) {
				w[K][i] = w[K][i - 1] * root;
			}
		}
	}
	inline void ntt(Z *f, const int &k, const bool &opt) {
		if (k > K) {
			prepare(k);
		}
		int n = 1 << k;
		std::vector<int> rev(n, 0);
		for (int i = 0; i < n; i++) {
			rev[i] = rev[i >> 1] >> 1 | (i & 1) << (k - 1);
			if (i < rev[i]) {
				std::swap(f[i], f[rev[i]]);
			}
		}
		for (int l = 1, t = 1; l < n; l <<= 1, t++) {
			for (int i = 0; i < n; i += l << 1) {
				Z *f1 = f + i, *f2 = f + i + l, *wk = w[t].data();
				for (int j = 0; j < l; j++) {
					Z x = (*f2) * (*wk++);
					*f2++ = *f1 - x;
					*f1++ += x;
				}
			}
		}
		if (opt) {
			std::reverse(f + 1, f + n);
			Z invN = inv(n);
			for (int i = 0; i < n; i++) {
				f[i] *= invN;
			}
		}
	}
}

struct Poly : std::vector<Z> {
	using std::vector<Z>::vector;
	inline void read() {
		for (auto &x : *this) {
			scanf("%u", &x.v);
		}
	}
	inline void read(const int &n) {
		this->resize(n);
		this->read();
	}
	inline void write(const char &mid = ' ') const {
		int n = this->size();
		for (int i = 0; i < n; i++) {
			printf("%u%c", this->operator[](i).v, i == n - 1 ? '\n' : mid);
		}
	}
	inline void reset(const int &n) {
		this->clear();
		this->resize(n, 0);
	}
	inline void reverse() {
		std::reverse(this->begin(), this->end());
	}
	inline void dft(const int &k) {
		NTT::ntt(this->data(), k, false);
	}
	inline void idft(const int &k) {
		NTT::ntt(this->data(), k, true);
	}
	inline Poly operator + (const Poly &rhs) const {
		Poly f(*this);
		f.resize(std::max(this->size(), rhs.size()), 0);
		for (int i = 0; i < (int)rhs.size(); i++) {
			f[i] += rhs[i];
		}
		return f;
	}
	inline Poly operator + (const Z &w) const {
		return this->operator+(Poly{w});
	}
	inline Poly operator += (const Poly &rhs) {
		this->resize(std::max(this->size(), rhs.size()), 0);
		for (int i = 0; i < (int)rhs.size(); i++) {
			this->operator[](i) += rhs[i];
		}
		return *this;
	}
	inline Poly operator += (const Z &w) {
		this->operator[](0) += w;
		return *this;
	}
	inline Poly operator - (const Poly &rhs) const {
		Poly f(*this);
		f.resize(std::max(this->size(), rhs.size()), 0);
		for (int i = 0; i < (int)rhs.size(); i++) {
			f[i] -= rhs[i];
		}
		return f;
	}
	inline Poly operator - (const Z &w) const {
		return this->operator-(Poly{w});
	}
	inline Poly operator -= (const Poly &rhs) {
		this->resize(std::max(this->size(), rhs.size()), 0);
		for (int i = 0; i < (int)rhs.size(); i++) {
			this->operator[](i) -= rhs[i];
		}
		return *this;
	}
	inline Poly operator -= (const Z &w) {
		this->operator[](0) -= w;
		return *this;
	}
	inline Poly operator - () const {
		Poly f(*this);
		for (auto &x : f) {
			x = -x;
		}
		return f;
	}
	inline Poly operator * (const Z &w) const {
		Poly f(*this);
		for (auto &x : f) {
			x *= w;
		}
		return f;
	}
	inline Poly operator *= (const Z &w) {
		for (auto &x : *this) {
			x *= w;
		}
		return *this;
	}
	inline Poly der() const {
		if (this->size() == 1u) {
			return Poly(0, 0);
		}
		int n = this->size();
		Poly f(n - 1, 0);
		for (int i = 1; i < n; i++) {
			f[i - 1] = this->operator[](i) * i;
		}
		return f;
	}
	inline Poly itg() const {
		int n = this->size();
		Poly f(n + 1, 0);
		for (int i = 0; i < n; i++) {
			f[i + 1] = this->operator[](i) * ::inv(i + 1);
		}
		return f;
	}
	inline Poly operator * (const Poly &rhs) const {
		int n = this->size(), m = rhs.size();
		if (n <= 10 || m <= 10 || n + m <= BRUTE_LIMIT) {
			Poly f(n + m - 1, 0);
			for (int i = 0; i < n; i++) {
				for (int j = 0; j < m; j++) {
					f[i + j] += this->operator[](i) * rhs[j];
				}
			}
			return f;
		}
		n += m - 1;
		int k = ceilLog(n), N = 1 << k;
		Poly f(*this), g(rhs);
		f.resize(N, 0);
		g.resize(N, 0);
		f.dft(k);
		g.dft(k);
		for (int i = 0; i < N; i++) {
			f[i] *= g[i];
		}
		f.idft(k);
		f.resize(n, 0);
		return f;
	}
	inline Poly operator *= (const Poly &rhs) {
		return (*this) = this->operator*(rhs);
	}
	inline Poly operator << (const int &k) const {
		int n = this->size();
		if (k >= n) {
			return Poly(n, 0);
		}
		Poly f(n, 0);
		std::copy_n(this->data(), n - k, f.data() + k);
		return f;
	}
	inline Poly operator >> (const int &k) const {
		int n = this->size();
		if (k >= n) {
			return Poly(n, 0);
		}
		Poly f(n, 0);
		std::copy_n(this->data() + k, n - k, f.data());
		return f;
	}
	inline Poly inv() const {
		assert(this->operator[](0).v != 0);
		int n = this->size(), k = ceilLog(n), N = 1 << k;
		Poly f(N, 0);
		f[0] = ::inv(this->operator[](0));
		for (int l = 2, i = 1; l <= N; l <<= 1, i++) {
			Poly p(this->data(), this->data() + std::min(n, l));
			p.resize(l, 0);
			Poly q(f.data(), f.data() + l);
			p.dft(i);
			q.dft(i);
			for (int j = 0; j < l; j++) {
				p[j] *= q[j];
			}
			p.idft(i);
			std::fill_n(p.data(), l >> 1, 0);
			p.dft(i);
			for (int j = 0; j < l; j++) {
				p[j] *= q[j];
			}
			p.idft(i);
			for (int j = (l >> 1); j < l; j++) {
				f[j] = -p[j];
			}
		}
		f.resize(n, 0);
		return f;
	}
	inline Poly operator / (const Poly &rhs) const {
		int n = this->size(), m = rhs.size();
		Poly f(*this), g(rhs);
		f.reverse();
		g.reverse();
		n -= m - 1;
		f.resize(n, 0);
		g.resize(n, 0);
		f *= g.inv();
		f.resize(n, 0);
		f.reverse();
		return f;
	}
	inline Poly operator % (const Poly &rhs) const {
		Poly f = this->operator-(this->operator/(rhs) * rhs);
		f.resize(rhs.size() - 1, 0);
		return f;
	}
	inline std::pair<Poly, Poly> div(const Poly &rhs) const {
		Poly f = this->operator/(rhs), g = this->operator-(f * rhs);
		g.resize(rhs.size() - 1, 0);
		return std::make_pair(f, g);
	}
	inline Poly sqrt() const {
		int n = this->size(), k = ceilLog(n), N = 1 << k;
		Poly a(*this), f(N, 0);
		a.resize(N, 0);
		f[0] = degree(a[0], 2);
		for (int i = 1; i <= k; i++) {
			int n = 1 << i, N = n << 1;
			Poly p(f.data(), f.data() + n);
			Poly q(a.data(), a.data() + n);
			Poly r = p.inv();
			p.resize(N, 0);
			q.resize(N, 0);
			r.resize(N, 0);
			p.dft(i + 1);
			q.dft(i + 1);
			r.dft(i + 1);
			for (int j = 0; j < N; j++) {
				p[j] = (p[j] + q[j] * r[j]) * Inv2;
			}
			p.idft(i + 1);
			std::copy_n(p.data(), n, f.data());
		}
		f.resize(n, 0);
		return f;
	}
	inline Poly ln() const {
		assert(this->operator[](0).v == 1);
		Poly f = this->der() * this->inv();
		f.resize(this->size(), 0);
		f = f.itg();
		f.pop_back();
		return f;
	}
	inline Poly exp() const {
		assert(this->operator[](0).v == 0);
		int n = this->size(), k = ceilLog(n), N = 1 << k;
		Poly a(*this), f(N, 0);
		a.resize(N, 0);
		f[0] = 1;
		for (int l = 2; l <= N; l <<= 1) {
			Poly p(f.data(), f.data() + l);
			Poly q(a.data(), a.data() + l);
			p *= q - p.ln() + 1;
			std::copy_n(p.data(), l, f.data());
		}
		f.resize(n, 0);
		return f;
	}
	inline Poly root(const int &k) const {
		assert(k >= 1);
		return k == 2 ? this->sqrt() : (this->ln() * ::inv(k)).exp();
	}
	inline Poly power(const int &k) const {
		assert(k >= 0);
		int n = this->size(), p = 0;
		for (; p < n && this->operator[](p).v == 0; p++);
		if (static_cast<uint64>(k) * p >= static_cast<uint64>(n)) {
			return Poly(n, 0);
		}
		Z w = this->operator[](p);
		return (((this->operator>>(p) * ::inv(w)).ln() * k).exp() * ::power(w, k)) << (k * p);
	}
};

struct Transposition {
	std::vector<int> ls, rs, pos;
	std::vector<Poly> h, g;
	inline Poly bruteMul(const Poly &a, const Poly &b) {
		int n = a.size(), m = b.size();
		Poly f(n - m + 1, 0);
		for (int i = 0; i <= n - m; i++) {
			for (int j = 0; j < m; j++) {
				f[i] += a[i + j] * b[j];
			}
		}
		return f;
	}
	inline Poly mul(const Poly &a, const Poly &b) {
		if (a.size() <= BRUTE_LIMIT) {
			return bruteMul(a, b);
		}
		int n = a.size(), m = b.size(), k = ceilLog(n), N = 1 << k;
		Poly f(a), g(b);
		g.reverse();
		f.resize(N, 0);
		g.resize(N, 0);
		f.dft(k);
		g.dft(k);
		for (int i = 0; i < N; i++) {
			f[i] *= g[i];
		}
		f.idft(k);
		return Poly(f.data() + m - 1, f.data() + n);
	}
	inline std::pair<Poly, Poly> mul2(const Poly &a, const Poly &b1, const Poly &b2) {
		if (a.size() <= BRUTE_LIMIT) {
			return std::make_pair(bruteMul(a, b2), bruteMul(a, b1));
		}
		int n = a.size(), m1 = b1.size(), m2 = b2.size(), k = ceilLog(n), N = 1 << k;
		Poly f(a), g(b2);
		g.reverse();
		f.resize(N, 0);
		g.resize(N, 0);
		f.dft(k);
		g.dft(k);
		for (int i = 0; i < N; i++) {
			g[i] *= f[i];
		}
		g.idft(k);
		Poly f1(g.data() + m2 - 1, g.data() + n);
		g = b1;
		g.reverse();
		g.resize(N, 0);
		g.dft(k);
		for (int i = 0; i < N; i++) {
			g[i] *= f[i];
		}
		g.idft(k);
		Poly f2(g.data() + m1 - 1, g.data() + n);
		return std::make_pair(f1, f2);
	}
	inline void build(int n) {
		ls.assign(n * 2 - 1, 0);
		rs.assign(n * 2 - 1, 0);
		h.assign(n * 2 - 1, Poly());
		g.assign(n * 2 - 1, Poly());
		pos.assign(n, 0);
		int idx = 0;
		std::function<void(int&, int, int)> dfs = [&](int &u, int l, int r) {
			u = idx++;
			if (l == r) {
				pos[l] = u;
				return;
			}
			int mid = (l + r) >> 1;
			dfs(ls[u], l, mid);
			dfs(rs[u], mid + 1, r);
		};
		int t;
		dfs(t, 0, n - 1);
	}
	inline std::vector<Z> _eval(const Poly &a, const std::vector<Z> &x) {
		int n = a.size();
		build(n);
		for (int i = 0; i < n; i++) {
			g[pos[i]] = Poly({1, -x[i]});
		}
		for (int i = n * 2 - 2; i >= 0; i--) {
			if (ls[i] > 0) {
				g[i] = g[ls[i]] * g[rs[i]];
			}
		}
		Poly f(a);
		f.resize(n * 2, 0);
		h[0] = mul(f, g[0].inv());
		for (int i = 0; i < n * 2 - 1; i++) {
			if (ls[i] > 0) {
				std::tie(h[ls[i]], h[rs[i]]) = mul2(h[i], g[ls[i]], g[rs[i]]);
			}
		}
		std::vector<Z> ans(n);
		for (int i = 0; i < n; i++) {
			ans[i] = h[pos[i]][0];
		}
		return ans;
	}
	inline std::vector<Z> eval(const Poly &a, const std::vector<Z> &_x) {
		int n = a.size(), m = _x.size();
		Poly f(a);
		std::vector<Z> x(_x);
		f.resize(std::max(n, m), 0);
		x.resize(std::max(n, m), 0);
		std::vector<Z> ans = _eval(f, x);
		ans.resize(m);
		return ans;
	}
	inline Poly inter(const std::vector<Z> &x, const std::vector<Z> &y) {
		int n = x.size();
		build(n);
		for (int i = 0; i < n; i++) {
			g[pos[i]] = Poly({1, -x[i]});
		}
		for (int i = n * 2 - 2; i >= 0; i--) {
			if (ls[i] > 0) {
				g[i] = g[ls[i]] * g[rs[i]];
			}
		}
		Poly f(g[0]);
		f.reverse();
		f = f.der();
		f.resize(n * 2, 0);
		h[0] = mul(f, g[0].inv());
		for (int i = 0; i < n * 2 - 1; i++) {
			if (ls[i] > 0) {
				std::tie(h[ls[i]], h[rs[i]]) = mul2(h[i], g[ls[i]], g[rs[i]]);
			}
		}
		for (int i = 0; i < 2 * n - 1; i++) {
			g[i].reverse();
		}
		for (int i = 0; i < n; i++) {
			h[pos[i]] = Poly({y[i] * ::inv(h[pos[i]][0])});
		}
		for (int i = n * 2 - 2; i >= 0; i--) {
			if (ls[i] > 0) {
				h[i] = h[ls[i]] * g[rs[i]] + h[rs[i]] * g[ls[i]];
			}
		}
		return h[0];
	}
};

const int N = 2e5;

int n, m, k, cnt[N + 5];
Poly f[N + 5];

struct PolySize {
	int id, siz;
	inline bool operator < (const PolySize &rhs) const {
		return siz > rhs.siz;
	}
};

std::priority_queue<PolySize> pq;

int main() {
	scanf("%d%d%d", &n, &m, &k);
	for (int x, i = 1; i <= n; i++) {
		scanf("%d", &x);
		cnt[x]++;
	}
	int idx = 0;
	for (int i = 1; i <= m; i++) {
		if (cnt[i] > 0) {
			cnt[i] = std::min(cnt[i], k);
			f[++idx].resize(cnt[i] + 1, 1);
			pq.push({idx, cnt[i] + 1});
		}
	}
	for (; pq.size() > 1u; ) {
		int u = pq.top().id;
		pq.pop();
		int v = pq.top().id;
		pq.pop();
		f[u] *= f[v];
		if (f[u].size() > k + 1) {
			f[u].resize(k + 1);
		}
		pq.push({u, f[u].size()});
	}
	printf("%u\n", f[pq.top().id][k].v);
	return 0;
}