#include <bits/stdc++.h> using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;} template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N,X,Y; ll ma[303][303]; void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>X>>Y; FOR(x,303) FOR(y,303) ma[x][y]=-1LL<<60; FOR(x,X+1) FOR(y,Y+1) ma[x][y]=0; FOR(i,N) { int A,B,C; cin>>A>>B>>C; FOR(x,X+1) FOR(y,Y+1) if(x>=A&&y>=B) ma[x-A][y-B]=max(ma[x-A][y-B],ma[x][y]+C); } cout<<ma[0][0]<<endl; } int main(int argc,char** argv){ string s;int i; if(argc==1) ios::sync_with_stdio(false), cin.tie(0); FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin); cout.tie(0); solve(); return 0; }