#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353, N = 2e5 + 5;
int a, n, m, n0, p[N], c, f[2005][2005], F[N], IF[N], ans;
int qpow(int x, int y) {
	int t = 1;
	for (; y; y>>=1) {
		if (y & 1) t = 1ll * t * x % MOD;
		x = 1ll * x * x % MOD;
	} return t;
}
int C(int n, int k) {
	return 1ll * F[n] * IF[k] % MOD * IF[n-k] % MOD;
}
int main() {
	cin >> a >> n >> m >> n0;
	if (a == 1 && n0 == 1) {
		for (int i=F[0]=1; i<=n+1; i++) F[i] = 1ll * F[i-1] * i % MOD;
		IF[n+1] = qpow(F[n+1], MOD - 2);
		for (int i=n; ~i; i--) IF[i] = 1ll * IF[i+1] * (i+1) % MOD;
		for (int i=1; i<=n-m; i++) ans = (ans + 1ll * (n - m - i & 1 ? MOD - qpow(i, n) : qpow(i, n)) * C(n + 1, m + i + 1)) % MOD;
		return cout << ans, 0;
	}
	for (int i=1; i<=a*n0; i++)
		scanf ("%d", &p[i]), c += i > 1 && p[i] < p[i-1];
	f[n0][c] = 1;
	for (int i=n0+1; i<=n; i++)
		for (int j=c; j<i; j++)
			f[i][j] = ((j ? 1ll * (a * (i - 1) - j + 1) * f[i-1][j-1] : 0) + 1ll * (j + 1) * f[i-1][j]) % MOD;
	cout << f[n][m];
}