//更大的問題在于你沒更多的保存中間值 ~_~

#include<iostream> //為避免無限的或大量的重復(fù)遞歸，，怎么辦？？，數(shù)組模擬

using namespace std;

const int N=100;
int f[N][N][N];

int recur(int a,int b,int c){

if(a<=0 || b<=0 || c<=0){
f[a][b][c]=1;
}
else if(a>20 || b>20 || c>20){
f[a][b][c]=recur(20,20,20);

}
else if(a<b && b<c){
if(f[a][b][c-1] == 0 )
f[a][b][c-1]=recur(a,b,c-1);
if(f[a][b-1][c-1]== 0)
f[a][b-1][c-1]=recur(a,b-1,c-1);
if(f[a][b-1][c] == 0 )
f[a][b-1][c]=recur(a,b-1,c);
f[a][b][c]=f[a][b][c-1]+f[a][b-1][c-1]-f[a][b-1][c];

}
else{
if(f[a-1][b][c] == 0)
f[a-1][b][c]=recur(a-1,b,c);
if(f[a-1][b][c-1] == 0)
f[a-1][b][c-1]=recur(a-1,b,c-1);
if(f[a-1][b-1][c] == 0)
f[a-1][b-1][c]=recur(a-1,b-1,c);
if(f[a-1][b-1][c-1]==0)
f[a-1][b-1][c-1]=recur(a-1,b-1,c-1);
f[a][b][c]=f[a-1][b][c]+f[a-1][b][c-1]+f[a-1][b-1][c]-f[a-1][b-1][c-1];
}

return f[a][b][c];

}

int main()
{

int a,b,c;

//cout<<"輸入3個(gè)數(shù): "<<endl;

while(cin>>a>>b>>c) {
//memset(f,0,sizeof(f));//寫這個(gè)就超時(shí)。。。

if(a==-1 && b==-1 && c==-1) break;

if(a<=0 || b<=0 || c<=0)
cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<1<<endl;

else
cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<recur(a,b,c)<<endl;
}

return 0;

}