#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll f[30][30][30];
ll dfs(ll a,ll b,ll c){
	if(a<=0 || b<=0 || c<=0) return 1;
	else if(a>20 || b>20 || c>20) return dfs(20,20,20);
	else if(f[a][b][c]!=0) return f[a][b][c];
	else if(a<b && b<c) return f[a][b][c]=dfs(a,b,c-1)+dfs(a,b-1,c-1)-dfs(a,b-1,c);
	else return f[a][b][c]=dfs(a-1,b,c)+dfs(a-1,b-1,c)+dfs(a-1,b,c-1)-dfs(a-1,b-1,c-1);
}
int main(){
	ll a,b,c;
	while(a!=-1 && b!=-1 && c!=-1){
		cin>>a>>b>>c;
		cout<<"w("<<a<<", "<<b<<", "<<c<<") = "<<dfs(a,b,c)<<endl;
	}
	return 0;
}

60分