#include<iostream>
#include<vector>
using namespace std;
using ll = long long;

int main() {
  ll n, x, y;
  cin >> n >> x >> y;
  vector<ll> a(n), b(n), c(n);
  for (ll i = 0; i < n; i++)
    cin >> a[i] >> b[i] >> c[i];
  vector dp(n + 1, vector(x + 1, vector<ll>(y + 1, 0)));
  
  for (ll i = 0; i < n; i++) {
    for (ll ix = 0; ix <= x; ix++) {      
      for (ll iy = 0; iy <= y; iy++) {
        dp[i + 1][ix][iy] = max(dp[i + 1][ix][iy], dp[i][ix][iy]);
        if (ix + a[i] <= x && iy + b[i] <= y) {
          dp[i + 1][ix + a[i]][iy + b[i]] = max(dp[i + 1][ix + a[i]][iy + b[i]], dp[i][ix][iy] + c[i]);
        }
      }
    }
  }
  ll ans = 0;
  for (ll ix = 0; ix <= x; ix++) {
    for (ll iy = 0; iy <= y; iy++) {
      ans = max(ans, dp[n][ix][iy]);
    }
  }
  cout << ans;
  return 0;
}