#include<bits/stdc++.h>
#define int long long
using namespace std;
const int MOD=998244353;
int n,m,k,dp[101][101][101][3];
signed main(){
    freopen("UNO.in","r",stdin);
    freopen("UNO.out","w",stdout);
    cin>>n>>m>>k;
    if(n>=1) dp[1][0][0][0]=1;
    if(m>=1) dp[0][1][0][1]=1;
    if(k>=1) dp[0][0][1][2]=1;
    for(int i=0;i<=n;i++){
        for(int j=0;j<=m;j++){
            for(int l=0;l<=k;l++){
                for(int last=0;last<3;last++){
                    if(!dp[i][j][l][last]) continue;
                    if(last!=0&&i+1<=n){
                        dp[i+1][j][l][0]=(dp[i+1][j][l][0]+dp[i][j][l][last])%MOD;
                    }
                    if(last!=1&&j+1<=m){
                        dp[i][j+1][l][1]=(dp[i][j+1][l][1]+dp[i][j][l][last])%MOD;
                    }
                    if(last!=2&&l+1<=k){
                        dp[i][j][l+1][2]=(dp[i][j][l+1][2]+dp[i][j][l][last])%MOD;
                    }
                }
            }
        }
    }
    cout<<(dp[n][m][k][0]+dp[n][m][k][1]+dp[n][m][k][2])%MOD;
}