#include<stdio.h>

int h, t,n;
int v[52], m[52], w[52];
int f[501][501];
int max(int x,int y) {
    return x > y ? x : y;
}
int main()
{
    scanf("%d %d", &h, &t);
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d %d %d", &v[i], &m[i], &w[i]);
    }
    for (int i = 1; i <= n; i++) {
        for (int j = h; j >= v[i]; j--) {
            for (int k = t; k >= m[i]; k--) {
                f[j][k] = (f[j][k], f[j - v[i]][k - m[i]] + w[i]);
            }
        }
    }
    printf("%d", f[h][t]);
    return 0;
}