#include <bits/stdc++.h>
#include <atcoder/all>
#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i,n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i,l,r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using P = pair<int,int>;
using LP = pair<long long,long long>;
using SP = pair<string,string>;
using vi = vector<int>;
using vl = vector<long long>;
using vs = vector<string>;
using vc = vector<char>;
using mint1 = modint1000000007;
using mint9 = modint998244353;
const int INF = 2e9;
const long long LINF = 4e18;
const int di[] = {0,1,0,-1,-1,1,-1,1};
const int dj[] = {1,0,-1,0,1,1,-1,-1};
template<class T> inline bool chmin(T& a, T b){if(a>b){a=b;return true;}return false;}
template<class T> inline bool chmax(T& a, T b){if(a<b){a=b;return true;}return false;}
void YesNo (bool ok , const string &s , const string &t) {if(ok) cout << s << endl; else cout << t << endl;} 


//-----def end-----//

const int Max = 305;
long long dp [Max][Max][Max];


int main () {
    int n , x , y;
    cin >> n >> x >> y;
    vector<int> a(n) , b(n) , c(n);
    rep(i , n) cin >> a[i] >> b[i] >> c[i];
    rep(i , Max) rep(j , Max) rep(k , Max) dp[i][j][k] = -LINF;
    dp[0][0][0] = 0;
    rep(i , n) rep(j , x+1) rep(k , y+1) {
        if(dp[i][j][k] == -LINF) continue;
        chmax(dp[i+1][j][k] , dp[i][j][k]);
        int nj = j+a[i] , nk = k+b[i];
        if(nj > x || nk > y) continue;
        chmax(dp[i+1][nj][nk] , dp[i][j][k]+c[i]);
    }
    long long res = -LINF;
    rep(j , x+1) rep(k , y+1) chmax(res , dp[n][j][k]);
    cout << res << endl;
	return 0;
}