递归

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