#include long long power_mod (long long a, long long b, long long mod_num) { long long ans = 1LL; if (b > 0LL) { ans = power_mod(a, b/2LL, mod_num); ans = (ans * ans) % mod_num; if (b%2LL == 1LL) { ans = (ans * (a % mod_num)) % mod_num; } } return ans; } int main () { int h = 0; int w = 0; int k = 0; int res = 0; long long ans = 0LL; long long mod_num = 998244353; long long hw = 0LL; long long div = 1LL; long long fact[60001] = {}; long long invf[60001] = {}; res = scanf("%d", &h); res = scanf("%d", &w); res = scanf("%d", &k); if (h > w) { int swap = h; h = w; w = swap; } hw = ((long long)h)*((long long)w); for (int i = 0; i < k; i++) { div *= hw+((long long)(k-i)); div %= mod_num; } fact[0] = 1LL; for (int i = 0; i < w+k; i++) { fact[i+1] = fact[i]; fact[i+1] *= (long long) (i+1); fact[i+1] %= mod_num; } invf[w+k] = power_mod(fact[w+k], mod_num-2LL, mod_num); for (int i = w+k; i > 0; i--) { invf[i-1] = invf[i]; invf[i-1] *= (long long)i; invf[i-1] %= mod_num; } div = (div*hw)%mod_num; for (int i = 1; i <= h; i++) { long long tmp = hw-((long long)i); tmp *= fact[h]; tmp %= mod_num; tmp *= invf[i]; tmp %= mod_num; tmp *= invf[h-i]; tmp %= mod_num; tmp *= fact[w]; tmp %= mod_num; tmp *= invf[i]; tmp %= mod_num; tmp *= invf[w-i]; tmp %= mod_num; tmp *= fact[i]; tmp %= mod_num; if (i < h) { long long sub = fact[h]; sub *= invf[i+1]; sub %= mod_num; sub *= invf[h-i-1]; sub %= mod_num; sub *= fact[w]; sub %= mod_num; sub *= invf[i+1]; sub %= mod_num; sub *= invf[w-i-1]; sub %= mod_num; sub *= fact[i+1]; tmp += mod_num-sub%mod_num; tmp %= mod_num; } tmp *= fact[i+k]; tmp %= mod_num; tmp *= invf[i]; tmp %= mod_num; div *= hw-((long long)i); div %= mod_num; ans += (tmp*power_mod(div, mod_num-2LL, mod_num))%mod_num; } printf("%lld\n", ans%mod_num); return 0; }