#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 30000100;
const ll mod = 998244353;

inline ll qpow(ll b, ll p) {
	ll res = 1;
	while (p) {
		if (p & 1) {
			res = res * b % mod;
		}
		b = b * b % mod;
		p >>= 1;
	}
	return res;
}

int n, m, K, N, fac[maxn], ifac[maxn], f[maxn], pr[maxn / 10], tot;
bool vis[maxn];

inline ll C(int n, int m) {
	if (n < m || n < 0 || m < 0) {
		return 0;
	} else {
		return 1LL * fac[n] * ifac[m] % mod * ifac[n - m] % mod;
	}
}

void solve() {
	scanf("%d%d%d", &n, &m, &K);
	N = n + m;
	fac[0] = 1;
	for (int i = 1; i <= N; ++i) {
		fac[i] = 1LL * fac[i - 1] * i % mod;
	}
	ifac[N] = qpow(fac[N], mod - 2);
	for (int i = N - 1; ~i; --i) {
		ifac[i] = 1LL * ifac[i + 1] * (i + 1) % mod;
	}
	for (int i = 2; i <= m; ++i) {
		if (!vis[i]) {
			pr[++tot] = i;
		}
		for (int j = 1; j <= tot && i * pr[j] <= m; ++j) {
			vis[i * pr[j]] = 1;
			if (i % pr[j] == 0) {
				break;
			}
		}
	}
	for (int i = 1; i <= m; ++i) {
		f[i] = C(n + m - i - 1, n - 1);
	}
	for (int i = 1; i <= tot; ++i) {
		for (int j = m / pr[i], k = m / pr[i] * pr[i]; j; --j, k -= pr[i]) {
			int &t = f[j];
			t = (((t += f[k]) >= mod) ? t - mod : t);
		}
	}
	ll ans = 1LL * n * f[1] % mod;
	for (int i = 2; i <= n; ++i) {
		ans = (ans + C(n, i) * (((i - K) & 1) ? mod - 1 : 1) % mod * C(i - 2, K - 1) % mod * f[i]) % mod;
	}
	ans = ans * qpow(C(n + m - 1, n - 1), mod - 2) % mod;
	ans = (ans + K) % mod;
	printf("%lld\n", ans);
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}