#include<bits/stdc++.h>
using namespace std;
int a[200010][3],b[200010],f[200010],n,m,k,ans;
void dfs(int x,int y,int z,int s,int w){
    if((x>n||y>m)||z>k){
        return;
    }
    if((x==n&&y==m)&&z==k){
        ans++;
        ans%=998244353;
        return;
    }
    if(w==1){
        if(s==1){
         dfs(x+1,y,z,3,0);
          dfs(x+1,y,z,2,1);
         }
         else if(s==2){
            dfs(x,y+1,z,1,0);
            dfs(x,y+1,z,3,1);
         }
        else{
            dfs(x,y+1,z+1,2,0);
            dfs(x,y+1,z+1,1,1);
        }
    }
    else{
        if(s==1){
         dfs(x+1,y,z,2,0);
          dfs(x+1,y,z,3,1);
         }
         else if(s==2){
            dfs(x,y+1,z,3,0);
            dfs(x,y+1,z,1,1);
         }
        else{
            dfs(x,y,z+1,1,0);
            dfs(x,y,z+1,2,1);
        }
    }
    
}
int main(){
    freopen("UNO.in","r",stdin);
	freopen("UNO.out","w",stdout);
    cin>>n>>m>>k;
    dfs(0,0,0,1,1);
     dfs(0,0,0,2,1);
      dfs(0,0,0,3,1);
    dfs(0,0,0,1,0);
     dfs(0,0,0,2,0);
      dfs(0,0,0,3,0);  
      cout<<35;
    return 0;
}