#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60;
const int IINF = 1 << 30 - 1;

template<typename T> struct Edge{
    int to; T w;
    Edge(int to_, T w_=1){
        to = to_;
        w=w_;
    }
};
template<typename T> using Tree = vector<vector<Edge<T>>>;
template<typename T> using Graph = vector<vector<Edge<T>>>;
/* 容量&重み付きエッジ for Dinic */
template<typename T> struct REdge{
    int to;
    T cap;
    T cost;
    int rev;
    REdge(int to_, T cap_, T cost_=1){
        to = to_;
        cap = cap_;
        cost = cost_;
    }
    
    REdge(int to_, T cap_, T cost_, int rev_){
        to = to_;
        cap = cap_;
        cost = cost_;
        rev = rev_;
    }
};

/* 残余グラフ for Dinic */
template<typename T> using RGraph = vector<vector<REdge<T>>>;

ll dp[301][301][301];
ll MAX = 300;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll n, x, y; cin >> n >> x >> y;
    vector<ll> a(n), b(n), c(n); rep(i, n) cin >> a[i] >> b[i] >> c[i];

    rep(i, MAX+1) rep(j, MAX+1) rep(k, MAX+1) dp[i][j][k] = -LINF;
    dp[0][0][0] = 0;
    for(ll i=1; i<=n; i++){
        for(ll j=0; j<=x; j++){
            for(ll k=0; k<=y; k++){
                dp[i][j][k] = dp[i-1][j][k];
                if(j-a[i-1]>=0 && k-b[i-1]>=0){
                    if(dp[i-1][j-a[i-1]][k-b[i-1]]!=-LINF) dp[i][j][k] = max(dp[i][j][k], dp[i-1][j-a[i-1]][k-b[i-1]]+c[i-1]);
                }
            }
        }
    }

    ll ans = 0;
    for(ll j=0; j<=x; j++) for(ll k=0; k<=y; k++) ans = max(ans, dp[n][j][k]);

    cout << ans << endl;
}