#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int dp[303][303];
int n,x,y;
vector<int> A,B,C;

void solve(){
	for(int k = 0;k<n;k++){
		for(int i = x;i>=0;i--){
			for(int j = y;j>=0;j--){
				int a = A[k];
				int b = B[k];
				int c = C[k];
				if(i-a>=0&&j-b>=0){
					dp[i][j] = max(dp[i][j],dp[i-a][j-b]+c);
				}
			}
		}
	}
	cout<<dp[x][y]<<endl;
}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n >> x >> y;
	A = B = C = vector<int>(n);
	for(int i = 0;i<n;i++){
		cin >> A[i] >> B[i] >> C[i];
	}
	solve();
}