#include <bits/stdc++.h>
using namespace std;
int main() {
    int n, x, y;
    cin >> n >> x >> y;
    vector<int> a(n), b(n);
    vector<long long> c(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i] >> c[i];
    }
    vector<vector<vector<long long>>> dp(
        n + 1, vector<vector<long long>>(x + 1, vector<long long>(y + 1, 0)));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= x; j++) {
            for (int k = 0; k <= y; k++) {
                dp[i + 1][j][k] = max(dp[i + 1][j][k], dp[i][j][k]);
                if (j + a[i] <= x && k + b[i] <= y) {
                    dp[i + 1][j + a[i]][k + b[i]] =
                        max(dp[i + 1][j + a[i]][k + b[i]], dp[i][j][k] + c[i]);
                }
            }
        }
    }
    cout << dp[n][x][y] << endl;
}