#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int M, G, n;
        cin >> M >> G >> n;

        vector dp(M + 1, vector<int>(G + 1));

        while (n--) {
            int a, b, c;
            cin >> a >> b >> c;

            for (int i = M; i >= a; i--) {
                for (int j = G; j >= b; j--) {
                    dp[i][j] = max(dp[i][j], dp[i - a][j - b] + c);
                }
            }
        }

        cout << dp[M][G] << '\n';
    };
    
    solve();
    
    return 0;
}