#include <bits/stdc++.h>
#include <atcoder/all>
 
#define elif else if
#define ll long long
#define vll vector<long long>
#define vec vector
#define embk emplace_back
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep3(i, n, k) for (ll i = k; i < n; i++)
#define all(a) a.begin(), a.end()
#define YNeos(bool) (bool ? "Yes" : "No")
 
using namespace std;
using namespace atcoder;
const ll INF = 1LL << 60;
const ll mod = 998244353;
const double pi = acos(-1);

int main() {
  ll n, x, y; cin >> n >> x >> y;
  vll a(n), b(n), c(n); rep(i, n) cin >> a[i] >> b[i] >> c[i];

  vec<vec<vll>> dp(n+1, vec<vll> (310, vll(310, -INF)));  //dp[i番目の機能まで見た][消費したメニュー枠*1000+消費した容量]=上げたかわいさの最大値
  dp[0][0][0] = 0;
  if ((a[0] <= x) && (b[0] <= y)) dp[0][a[0]][b[0]] = c[0];

  rep(i, n) {
    rep(j, x) {
      rep(k, y) {
        dp[i+1][j][k] = max(dp[i][j][k], dp[i+1][j][k]);
        if ((j+a[i] <= x) && (k+b[i] <= y)) dp[i+1][j+a[i]][k+b[i]] = max(dp[i][j][k]+c[i], dp[i+1][j+a[i]][k+b[i]]);
      }
    }
  }

  ll ans = 0;
  rep(i, n+1) {
    rep(j, x+1) {
      rep(k, y+1) {
        ans = max(dp[i][j][k], ans);
      }
    }
  }

  cout << ans << endl;
}