#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define fi first
#define se second

const int MAX = 510000;
const ll MOD = 998244353;

ll fac[MAX],finv[MAX],inv[MAX];

void COMinit(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%MOD;
    inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
    finv[i]=finv[i-1]*inv[i]%MOD;
  }
}

ll COM(int n,int k){
  if(n<k) return 0;
  if(n<0||k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%MOD)%MOD;
}

int main(){
  COMinit();
  int red,blue,x;
  cin>>red>>blue>>x;
  ll answer=0;
  if(x==0){
    cout<<1<<endl;
    return 0;
  }
  for(int i=0;i<=blue;i++){
    int leftblue=blue-i;
    ll que=COM(red,x);
    leftblue-=x;
    que*=COM(x-1+leftblue,x-1);
    answer+=que%MOD;
    answer%=MOD;
  }
  cout<<answer<<endl;
}