#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N, X, Y;
	cin >> N >> X >> Y;
	vi A(N), B(N), C(N);
	rep(i, N) cin >> A[i] >> B[i] >> C[i];

	lint a=0, b=0, c=0, x, y, z;
	vector<vvi> dp(N+1, vvi(X+1, vi(Y+1, -LINF)));
	dp[0][0][0] = 0;
	rep(i, N) {
		rep(j, X+1) {
			rep(k, Y+1) {
				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]);
			}
		}
	}
	rep(j, X+1) {
		rep(k, Y+1) {
			chmax(a, dp[N][j][k]);
		}
	}
	cout << a << endl;
}