#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<int(n); ++i)
#define repll(i,m,n) for(ll i=m; i<ll(n); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi first
#define se second

template<typename T> bool chmin(T& a, T b){ if(a > b){a = b; return true;} return false; }
template<typename T> bool chmax(T& a, T b){ if(a < b){a = b; return true;} return false; }

template<typename T> T gcd(T a, T b){ return a % b ? gcd(b, a % b) : b; }
template<typename T> T lcm(T a, T b){ return a / gcd(a, b) * b; }

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N, X, Y;
    cin >> N >> X >> Y;
    vector<ll> A(N), B(N), C(N);
    rep(i, 0, N) cin >> A[i] >> B[i] >> C[i];

    vector dp(N+1, vector(X+1, vector<ll>(Y+1, -1LL)));
    dp[0][0][0] = 0LL;

    rep(i, 0, N){
        rep(j, 0, X+1){
            rep(k, 0, Y+1){
                if(dp[i][j][k] == -1LL) continue;
                if(j + A[i] <= X && k + B[i] <= Y) chmax(dp[i+1][j + A[i]][k + B[i]], dp[i][j][k] + C[i]);
                chmax(dp[i+1][j][k], dp[i][j][k]);
            }
        }
    }

    ll ans = -1LL;
    rep(j, 0, X+1){
        rep(k, 0, Y+1){
            chmax(ans, dp[N][j][k]);
        }
    }
    cout << ans << endl;

    return 0;
}