#include<bits/stdc++.h>
using namespace std;
long long a,b,c,f[21][21][21];
int main(){
	for (int i=0;i<=20;i++)
		for (int j=0;j<=20;j++)
			for (int k=0;k<=20;k++){
				if (i==0 || j==0 || k==0) f[i][j][k]=1;
				else if (a<b && b<c) f[i][j][k]=f[i][j][k-1]+f[i][j-1][k-1]-f[i][j-1][k];
				else f[i][j][k]=f[i-1][j][k]+f[i-1][j-1][k]+f[i-1][j][k-1]-f[i-1][j-1][k-1];
			}
	while (cin>>a>>b>>c){
		if (a==-1 && b==-1 && c==-1) break;
		if (a<=0 || b<=0 || c<=0) printf("w(%d, %d, %d) = 1\n",a,b,c);
		else if (a>20 || b>20 || c>20) printf("w(%d, %d, %d) = %d\n",a,b,c,f[20][20][20]);
		else printf("w(%d, %d, %d) = %d\n",a,b,c,f[a][b][c]);
	}
}