#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 2000005
#define int long long
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,k,t[N],fac[N],inv[N],ans,x,y,z;const int mod=998244353;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int fp(int a,int n)
{
    int ans=1;
    while(n)
    {
        if(n&1)ans=ans*a%mod;
        a=a*a%mod;
        n>>=1;
    }
    return ans;
}
int ny(int x){return fp(x,mod-2);}
int C(int n,int m){return fac[n]*inv[m]%mod*inv[n-m]%mod;}
int solve(int k)
{
    int sum=0;
    fo(a,0,k)
    {
        int b=k-a;
        if(((n+m)&1)!=(a&1))continue;
        int len=n+m-a-b*2>>1;
        if(len<0)continue;
        if(m-n>a)continue;
        sum+=C(len+k-1,k-1)*C(k,a)%mod*C(a,a+n-m>>1)%mod*t[b]%mod;
        if(sum>=mod)sum-=mod;
    }
    return sum;
}
int read(){
    int sum=0;bool f=0;char c=getchar();
    for(;c<48||c>57;c=getchar())if(c==45)f=1;
    for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
    return f?-sum:sum;
}
signed main(){
    freopen("UNO.in","r",stdin);freopen("UNO.out","w",stdout);
    fac[0]=inv[0]=1;fo(i,1,N-1)fac[i]=fac[i-1]*i%mod;
    inv[N-1]=ny(fac[N-1]);rf(i,N-2,1)inv[i]=inv[i+1]*(i+1)%mod;
    t[0]=1;fo(i,1,N-1)t[i]=t[i-1]*2%mod;
    n=read();m=read();k=read();
    if(n>m)swap(n,m);
    printf("%lld",(solve(k+1)+solve(k)*2+solve(k-1))%mod);
    return 0;
}