#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
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 (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N,X,Y; cin >> N >> X >> Y;
  vector<vector<ll>> dp(X+1,vector<ll>(Y+1,-(1LL<<60)));
  dp[0][0]=0;
  rep(i,N){
    auto nxt = dp;
    int a,b; ll c; cin >> a >> b >> c;
    for(int x=0;x<X;x++){
      for(int y=0;y<Y;y++){
        if(x+a<=X&&y+b<=Y) chmax(nxt[x+a][y+b],dp[x][y]+c);
      }
    }
    swap(dp,nxt);
  }
  ll ans = 0;
  rep(i,X+1){
    rep(j,Y+1) chmax(ans,dp[i][j]);
  }
  cout << ans << endl;
  return 0;
}