#line 2 "/home/cocojapanpan/Procon_CPP/proconLibrary/lib/template/procon.hpp"

#ifndef DEBUG
// 提出時にassertはオフ
#ifndef NDEBUG
#define NDEBUG
#endif
// 定数倍高速化
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif

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

#define ALL(x) (x).begin(), (x).end()
template <class T>
using vec = vector<T>;
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T>
constexpr T INF = 1'000'000'000;
template <>
constexpr int INF<int> = 1'000'000'000;
template <>
constexpr ll INF<ll> = ll(INF<int>) * INF<int> * 2;
#line 2 "main.cpp"

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, X, Y;
    cin >> N >> X >> Y;
    vec<ll> A(N), B(N), C(N);
    for(int i = 0; i < N; i++) {
        cin >> A[i] >> B[i] >> C[i];
    }
    // dp[a][b] [0,i)の中を使って、枠をa以下、容量をb以下でできる最大かわいさ
    vec<vec<ll>> dp(X + 1, vec<ll>(Y + 1, 0));
    for(int i = 0; i <= N - 1; i++) {
        vec<vec<ll>> curdp = dp;
        for(int a = 0; a <= X; a++) {
            for(int b = 0; b <= Y; b++) {
                if(a + A[i] <= X && b + B[i] <= Y) {
                    chmax(curdp[a + A[i]][b + B[i]], dp[a][b] + C[i]);
                }
            }
        }
        swap(dp, curdp);
    }
    ll ans = 0;
    for(int x = 0; x <= X; x++) {
        for(int y = 0; y <= Y; y++) {
            chmax(ans, dp[x][y]);
        }
    }
    cout << ans << "\n";
}