#include<iostream>
using namespace std;
int v[55] , m[55] , val[55] , ans[410][410];
int main()
{
	int vol , mas , n;
	cin >> vol >> mas >> n;
	for(int i = 1;i <= n;i++) cin >> v[i] >> m[i] >> val[i];
	for(int i = 1;i <= vol;i++)
		for(int j = 1;j <= mas;j++)
			for(int k = 1;k <= n;k++)
				if(v[k] <= i && m[k] <= j) ans[i][j] = max(ans[i][j] , ans[i-v[k]][j-m[k]] + val[k]);
	cout << ans[vol][mas] << endl;
	return 0;
}