#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, X, Y, ans=0;
    cin >> N >> X >> Y;
    vector<ll> A(N), B(N), C(N);
    for (int i=0; i<N; i++) cin >> A[i] >> B[i] >> C[i];
    vector<vector<vector<ll>>> dp(N+1, vector(X+1, vector<ll>(Y+1)));

    for (int i=1; i<=N; i++){
        for (int j=0; j<=X; j++){
            for (int k=0; k<=Y; k++){
                dp[i][j][k] = max(dp[i-1][j][k], dp[i][j][k]);
                if (j-A[i-1]>=0 && k-B[i-1]>=0) dp[i][j][k] = max(dp[i][j][k], dp[i-1][j-A[i-1]][k-B[i-1]]+C[i-1]);
            }
        }
    }

    for (int j=0; j<=X; j++){
        for (int k=0; k<=Y; k++) ans = max(ans, dp[N][j][k]);
    }

    cout << ans << endl;

    return 0;
}