#ifndef CLASS_MODINT
#define CLASS_MODINT

#include <cstdint>

template <std::uint32_t mod>
class modint {
private:
	std::uint32_t n;
public:
	modint() : n(0) {};
	modint(std::int64_t n_) : n((n_ >= 0 ? n_ : mod - (-n_) % mod) % mod) {};
	static constexpr std::uint32_t get_mod() { return mod; }
	std::uint32_t get() const { return n; }
	bool operator==(const modint& m) const { return n == m.n; }
	bool operator!=(const modint& m) const { return n != m.n; }
	modint& operator+=(const modint& m) { n += m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator-=(const modint& m) { n += mod - m.n; n = (n < mod ? n : n - mod); return *this; }
	modint& operator*=(const modint& m) { n = std::uint64_t(n) * m.n % mod; return *this; }
	modint operator+(const modint& m) const { return modint(*this) += m; }
	modint operator-(const modint& m) const { return modint(*this) -= m; }
	modint operator*(const modint& m) const { return modint(*this) *= m; }
	modint inv() const { return (*this).pow(mod - 2); }
	modint pow(std::uint64_t b) const {
		modint ans = 1, m = modint(*this);
		while (b) {
			if (b & 1) ans *= m;
			m *= m;
			b >>= 1;
		}
		return ans;
	}
};

#endif // CLASS_MODINT

#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
using mint = modint<998244353>;
mint solve(int N, int M, int K) {
	vector<mint> fact(N + M + 2);
	fact[0] = 1;
	for (int i = 1; i <= N + M + 1; ++i) {
		fact[i] = fact[i - 1] * i;
	}
	function<mint(int, int)> comb = [&](int x, int y) {
		if (x < 0 || y < 0 || x < y) {
			return mint(0);
		}
		return fact[x] * fact[y].inv() * fact[x - y].inv();
	};
	mint a11 = fact[K - 1] * (K - 3) * (K - 2) * (K - 1) * mint(4).inv() * comb(N, K - 1) * comb(M, K - 1); // (K - 1) * (K - 1)
	mint a21 = fact[K] * (K - 2) * (3 * K - 5) * mint(24).inv() * comb(N, K - 2) * comb(M, K); // (K - 2) * K
	mint a31 = fact[K] * (K - 2) * (3 * K - 5) * mint(24).inv() * comb(N, K) * comb(M, K - 2); // K * (K - 2)
	mint a41 = fact[K - 2] * (K - 3) * (K - 2) * (K - 1) * mint(2).inv() * comb(N, K - 2) * comb(M, K - 1); // (K - 1) * (K - 2) type 1
	mint a51 = fact[K - 2] * (K - 3) * (K - 2) * (K - 1) * mint(2).inv() * comb(N, K - 1) * comb(M, K - 2); // (K - 2) * (K - 1) type 1
	mint a42 = fact[K - 2] * (K - 4) * (K - 3) * (K - 2) * (K - 1) * mint(2).inv() * comb(N, K - 2) * comb(M, K - 1); // (K - 1) * (K - 2) type 2
	mint a52 = fact[K - 2] * (K - 4) * (K - 3) * (K - 2) * (K - 1) * mint(2).inv() * comb(N, K - 1) * comb(M, K - 2); // (K - 2) * (K - 1) type 2
	mint a43 = fact[K - 2] * (K - 3) * (K - 2) * (K - 1) * mint(2).inv() * comb(N, K - 2) * comb(M, K - 1); // (K - 1) * (K - 2) type 3
	mint a53 = fact[K - 2] * (K - 3) * (K - 2) * (K - 1) * mint(2).inv() * comb(N, K - 1) * comb(M, K - 2); // (K - 2) * (K - 1) type 3
	mint a61 = fact[K - 2] * (K - 4) * (K - 3) * (K - 2) * comb(N, K - 2) * comb(M, K - 2); // (K - 2) * (K - 2) type 1
	mint a62 = fact[K - 2] * (K - 5) * (K - 4) * (K - 3) * (K - 2) * mint(2).inv() * comb(N, K - 2) * comb(M, K - 2); // (K - 2) * (K - 2) type 2
	mint a63 = fact[K - 2] * (K - 4) * (K - 3) * (K - 2) * comb(N, K - 2) * comb(M, K - 2); // (K - 2) * (K - 2) type 3
	mint a64 = fact[K - 2] * (K - 3) * (K - 2) * mint(4).inv() * comb(N, K - 2) * comb(M, K - 2); // (K - 2) * (K - 2) type 4
	mint ans = a11 + a21 + a31 + a41 + a51 + a42 + a52 + a43 + a53 + a61 + a62 + a63 + a64;
	return ans;
}
int main() {
	int N, M, K;
	cin >> N >> M >> K;
	mint ans = solve(N, M, K);
	cout << ans.get() << endl;
	return 0;
}