#include<bits/stdc++.h>
using namespace std;
#define sq(x) (x)*(x)


const int MOD = 998244353;

struct ModInt{
    int x;
    ModInt(int x = 0) : x(x + (x < 0) * MOD - (x >= MOD) * MOD){}
    ModInt operator+(ModInt o) { return x + o.x; }
    ModInt operator-(ModInt o) { return x - o.x; }
    ModInt operator*(ModInt o) { return 1LL * x * o.x % MOD; }
    ModInt operator/(ModInt b) { return *this * b.inv(); }
    ModInt inv() { return pow(MOD-2); }
    ModInt pow(long long e){
        if(!e)return 1;
        ModInt r = pow(e/2); r = r * r;
        return e % 2 ? *this * r : r;
    }
    bool operator==(ModInt o) { return x == o.x; }
};

const int maxn = 40000;

ModInt factorial[maxn+1];
ModInt invfactorial[maxn+1];
//ModInt

ModInt binom(int n, int k){
	if(n < 0 || k < 0 || n < k)return 0;
	return factorial[n]*invfactorial[n-k]*invfactorial[k];
}

ModInt invbinom(int n, int k){
	if(n < 0 || k < 0 || n < k)return 0;
	return invfactorial[n]*factorial[n-k]*factorial[k];
}


int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	factorial[0] = 1;
	for(int i = 1; i <= maxn; i++)factorial[i] = factorial[i-1]*i;
	invfactorial[maxn] = factorial[maxn].inv();
	for(int i = maxn-1; i >= 0; i--)invfactorial[i] = invfactorial[i+1]*(i+1);
	int q, r, s;
	cin >> s >> r >> q;
	ModInt Kreweras= 0;
	for(int i = 1; i <= q; i++){
		for(int j = 1; j <= r; j++){
			if((i+j)%2 == 0) Kreweras = Kreweras + binom(q,i)*binom(r,j)*binom(2*(i+j-1),2*i-1)*invbinom(i+j+s, s+2);
			else Kreweras = Kreweras - binom(q,i)*binom(r,j)*binom(2*(i+j-1),2*i-1)*invbinom(i+j+s, s+2);
		}
	}
	Kreweras = Kreweras * ModInt(1)/(ModInt(s+1)*ModInt(s+2));
	Kreweras = Kreweras - ModInt(q+r)/ModInt(s+1);
	Kreweras = Kreweras + ModInt(1);
	ModInt total = binom(q + r + s, q)*binom(r+s, r);
	Kreweras = Kreweras * total;
	cout << Kreweras.x << '\n';
	return 0;
}