abc 297 f 容斥

题意：h×w的网格上选k个点，用最小矩形包含，求最小矩形的大小期望。

思路：枚举最小矩形的大小，然后用容斥去求最小矩形为i,j的方案数再乘上大小和放置的可能。

/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
typedef pair<int, int> pii;
#define int long long
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
const int mod = 998244353;
int fact[1000005];
int infact[1000005];
int ksm(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) {
			res = res * a % mod;
		}
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}
void ini() {
	fact[0] = 1;
	infact[0] = 1;
	for (int i = 1; i <= 1000000; i++) {
		fact[i] = fact[i - 1] * i % mod;
		infact[i] = infact[i - 1] * ksm(i, mod - 2) % mod;
	}
}
int c(int a, int b) {
	if (a < b) {
		return 0;
	}
	return fact[a] * infact[b] % mod * infact[a - b] % mod;
}
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int h, w, k;
	ini();
	cin >> h >> w >> k;
	int ans = 0;
	for (int i = 1; i <= h; i++) {
		for (int j = 1; j <= w; j++) {
			int sum = c(i * j, k);
			sum = (sum - c(i * j - j, k) * 2 % mod + mod) % mod;
			sum = (sum - c(i * j - i, k) * 2 % mod + mod) % mod;
			sum = (sum + c((i - 1) * (j - 1), k) * 4 % mod) % mod;
			if (i >= 2) {
				sum = (sum + c((i - 2) * j, k)) % mod;
				sum = (sum - c((i - 2) * (j - 1), k) * 2 % mod + mod) % mod;
			}
			if (j >= 2) {
				sum = (sum + c((j - 2) * i, k)) % mod;
				sum = (sum - c((i - 1) * (j - 2), k) * 2 % mod + mod) % mod;
			}
			if (i >= 2 && j >= 2) {
				sum = (sum + c((i - 2) * (j - 2), k) + mod) % mod;
			}
			ans = (ans + sum * i % mod * j % mod * (h - i + 1) % mod * (w - j + 1) % mod) % mod;
//			ans %= mod;
		}
	}
//	cout << ans << endl;
	cout << ans*ksm(c(h * w, k), mod - 2) % mod << endl;
	return 0;
}