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

void solve() {
    int N, X, Y;
    cin >> N >> X >> Y;
    vector<vector<ll>> dp(X + 1, vector<ll>(Y + 1, 0));
    for (int i = 0; i < N; i++) {
        ll a, b, c;
        cin >> a >> b >> c;
        for (int j = X - a; j >= 0; j--) {
            for (int k = Y - b; k >= 0; k--) {
                dp[j + a][k + b] = max(dp[j + a][k + b], dp[j][k] + c);
            }
        }
    }
    cout << dp[X][Y] << "\n";
}

int main() {
    ios::sync_with_stdio(false); // Disable synchronization with stdio for faster I/O
    cin.tie(nullptr); // Untie cin from cout for faster I/O

    solve(); // Process a single test case
}