#include using namespace std; #define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++) #define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define el '\n' #define spa " " #define Yes cout << "Yes" << el #define No cout << "No" << el #define YES cout << "YES" << el #define NO cout << "NO" << el #define eps (1e-10) #define Equals(a,b) (fabs((a) - (b)) < eps ) #define debug(x) cerr << #x << " = " << x << el using ll = long long; using ull = unsigned long long; using pii = pair; using pll = pair; using vi = vector; using vl = vector; using vvl = vector>; using vs = vector; using vb = vector; const double pi = 3.141592653589793238; const int inf = 1073741823; const ll infl = 1LL << 60; const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string abc = "abcdefghijklmnopqrstuvwxyz"; const ll MOD = 998244353; #include using namespace atcoder; using mint = modint998244353; using vm = vector; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll n,x,y;cin>>n>>x>>y; auto ok=[&](ll a,ll b){ if(a>=0&&a<=x&&b>=0&&b<=y)return true; return false; }; vvl dp(x+1,vl(y+1,-infl)); dp[0][0]=0; rep(k,0,n){ ll a,b,c;cin>>a>>b>>c; for(ll i=x;i>=0;i--)for(ll j=x;j>=0;j--){ if(dp[i][j]<0)continue; if(ok(i+a,j+b)){ dp[i+a][j+b]=max(dp[i+a][j+b],dp[i][j]+c); } } } ll ans=0; rep(i,0,x+1)rep(j,0,y+1){ ans=max(ans,dp[i][j]); } cout<