#include<bits/stdc++.h>
#define ll long long
#define N 101
#define mod 998244353
using namespace std;
ll n,m,k,dp[N][N][N][3];
ll dfs(int a,int b,int c,int now){
    if(a+b+c<2){
        if(a==1&&now==0) return 0;
        if(b==1&&now==1) return 0;
        if(c==1&&now==2) return 0;
        return 1;
    }
    if(dp[a][b][c][now]!=-1) return dp[a][b][c][now];
    ll ans=0;
    if(now==0){
        if(b>0) ans+=dfs(a,b-1,c,1);
        ans%=mod;
        if(c>0) ans+=dfs(a,b,c-1,2);
        ans%=mod;
    }else if(now==1){
        if(a>0) ans+=dfs(a-1,b,c,0);
        ans%=mod;
        if(c>0) ans+=dfs(a,b,c-1,2);
        ans%=mod;
    }else{
        if(a>0) ans+=dfs(a-1,b,c,0);
        ans%=mod;
        if(b>0) ans+=dfs(a,b-1,c,1);
        ans%=mod;
    }
    return dp[a][b][c][now]=ans;
} 
int main(){
    freopen("UNO.in","r",stdin);
    freopen("UNO.out","w",stdout);
    cin>>n>>m>>k;
    memset(dp,-1,sizeof(dp));
    cout<<(dfs(n,m,k,0)+dfs(n,m,k,1)+dfs(n,m,k,2))/2%mod<<endl;
    return 0;
}