#include<iostream>
#include<cstdio>
using namespace std;
int n,m,k;
long long dp[105][105][105][4];
int main(){
    freopen("UNO.in","r",stdin);
    freopen("UNO.out","w",stdout);
    scanf("%d%d%d",&n,&m,&k);
    dp[1][0][0][1]=dp[0][1][0][2]=dp[0][0][1][3]=1;
    for(int i=0;i<=n;i++){
        for(int j=0;j<=m;j++){
            for(int z=0;z<=k;z++){
                if((i==0&&j==0)||(i==0&&z==0)||(j==0&&z==0))    continue;
                if(i)   dp[i][j][z][1]=dp[i-1][j][z][2]+dp[i-1][j][z][3];
                if(j)   dp[i][j][z][2]=dp[i][j-1][z][1]+dp[i][j-1][z][3];
                if(z)   dp[i][j][z][3]=dp[i][j][z-1][1]+dp[i][j][z-1][2];
            }
        }
    }
    printf("%lld",(dp[n][m][k][1]+dp[n][m][k][2]+dp[n][m][k][3])%998244353);
    return 0;
}