//2024.7.29 ljl luogu P1464 Function
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll a, b, c, jiyi[30][30][30] = {0};

ll w(ll a, ll b, ll c) {
	if (a <= 0 || b <= 0 || c <= 0)
		return 1;
	if (a > 20 || b > 20 || c > 20)
		return w(20, 20, 20);
	if (a < b && b < c) {
		if (jiyi[a][b][c - 1] == 0)//是否有记忆
			jiyi[a][b][c - 1] = w(a, b, c - 1);
		if (jiyi[a][b - 1][c - 1] == 0)
			jiyi[a][b - 1][c - 1] = w(a, b - 1, c - 1);
		if (jiyi[a][b - 1][c] == 0)
			jiyi[a][b - 1][c] = w(a, b - 1, c);
		jiyi[a][b][c] = jiyi[a][b][c - 1] + jiyi[a][b - 1][c - 1] - jiyi[a][b - 1][c];
	} else {
		if (jiyi[a - 1][b][c] == 0)
			jiyi[a - 1][b][c] = w(a - 1, b, c);
		if (jiyi[a - 1][b - 1][c] == 0)
			jiyi[a - 1][b - 1][c] = w(a - 1, b - 1, c);
		if (jiyi[a - 1][b][c - 1] == 0)
			jiyi[a - 1][b][c - 1] = w(a - 1, b, c - 1);
		if (jiyi[a - 1][b - 1][c - 1] == 0)
			jiyi[a - 1][b - 1][c - 1] = w(a - 1, b - 1, c - 1);
		jiyi[a][b][c] = jiyi[a - 1][b][c] + jiyi[a - 1][b - 1][c] + jiyi[a - 1][b][c - 1] - jiyi[a - 1][b - 1][c - 1];
	}//记忆化
	return jiyi[a][b][c];
}

int main() {
	while (1) {
		cin >> a >> b >> c;
		if (a == -1 && b == -1 && c == -1)
			return 0;
		cout << "w(" << a << "," << b << "," << c << ")=" << w(a, b, c) << endl;
	}
	return 0;
}