#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N1 = 504;
const int N2 = 54;
const int INF = 1e9 + 7;
int dp[N1][N2][2];
int ndp[N1][N2][2];
int v1, v2, n;

void updMax(int& a, int b)
{
	a = max(a, b);
}

void solve()
{
	FOR (i, 0, N1) FOR (j, 0, N2) dp[i][j][0] = dp[i][j][1] = -INF;
	dp[0][0][0] = 0;
	FOR (it, 0, n)
	{
		int p, h, s;
		cin >> p >> h >> s;
		FOR (i, 0, N1) FOR (j, 0, N2) ndp[i][j][0] = ndp[i][j][1] = -INF;
		FOR (i, 0, v1 + 1)
		{
			FOR (j, 0, v2 + 1)
			{
				FOR (t, 0, 2)
				{
					if (i + p <= v1)
						updMax(ndp[i + p][j][t], dp[i][j][t] + h); 
					if (j + p <= v2)
						updMax(ndp[i][j + p][t], dp[i][j][t] + h);
					if (s == 0)
						updMax(ndp[i][j][t], dp[i][j][t]);
				}
				updMax(ndp[i][j][1], dp[i][j][0] + h);
			}
		}
		FOR (i, 0, v1 + 1) FOR (j, 0, v2 + 1) FOR(k, 0, 2) dp[i][j][k] = ndp[i][j][k];
	}
	int ans = -1;
	FOR (i, 0, v1 + 1)
		FOR (j, 0, v2 + 1)
			FOR (k, 0, 2)
				updMax(ans, dp[i][j][k]);
	cout << ans << '\n' << '\n';
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	for (int tc = 1; ; tc++)
	{
		cin >> v1 >> v2 >> n;
		if (v1 == 0)
			break;
		cout << "Case " << tc << ": "; 
		solve();
	}
	
	
	return 0;
}