#include<iostream>
#include<string.h>
#include<stdio.h>
using namespace std;
int maxt,maxz,n;
int tj[50],zl[50],kl[50];
int f[100];
int main()
{
int i,j,k;
cin>>maxt>>maxz;
cin>>n;
for (i=1;i<=n;i++) cin>>tj[i]>>zl[i]>>kl[i];
for (i=1;i<=n;i++)
for (j=maxt;j>=tj[i];j--)
for (k=maxz;k>=zl[i];k--)
if (f[j - tj[i]][k - zl[i]] + kl[i] > f[j][k]) {
f[j][k] = f[j - tj[i]][k - zl[i]] + kl[i];

printf("%d\n",f[maxt][maxz]);

system("pause");
return 0;
}