#include <stdio.h>

const int Mod = 998244353;
long long fact[9000001], fact_inv[9000001];

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

long long combination(int n, int k)
{
	return fact[n] * fact_inv[k] % Mod * fact_inv[n-k] % Mod;
}

int main()
{
	int N, M, K;
	scanf("%d %d %d", &N, &M, &K);

	int i;
	for (i = 1, fact[0] = 1; i <= N * N; i++) fact[i] = fact[i-1] * i % Mod;
	for (i = N * N - 1, fact_inv[N*N] = div_mod(1, fact[N*N], Mod); i >= 0; i--) fact_inv[i] = fact_inv[i+1] * (i + 1) % Mod;

	int j, k, x, y;
	long long ans = 0, tmp;
	for (x = 1; x <= N; x++) {
		for (y = 1; y <= N; y++) {
			if (K + x + y > N * 2 || x * y < M) continue;
			if ((N * 2 - K - x - y) % 2 == 0) ans += combination(x * y, M) * combination(N, x) % Mod * combination(N, y) % Mod * combination(N * 2 - (x + y), K) % Mod;
			else ans += Mod - combination(x * y, M) * combination(N, x) % Mod * combination(N, y) % Mod * combination(N * 2 - (x + y), K) % Mod;
		}
	}
	printf("%lld\n", ans % Mod);
	fflush(stdout);
	return 0;
}