#include <bits/stdc++.h>
using namespace std;
 
int main() {
  int N, X, Y; cin >> N >> X >> Y;
  vector DP(N + 1, vector<vector<long long>>(X + 1, vector<long long>(Y + 1, -1e18)));
  DP[0][0][0] = 0;

  for (int i = 0; i < N; i++) {
    int A, B, C; cin >> A >> B >> C;

    for (int j = 0; j <= X; j++) {
      for (int k = 0; k <= Y; k++) {
        DP[i + 1][j][k] = max(DP[i + 1][j][k], DP[i][j][k]);
        if (j + A > X || k + B > Y) continue;
        DP[i + 1][j + A][k + B] = max(DP[i + 1][j + A][k + B], DP[i][j][k] + C);
      }
    }
  }

  long long Ans = 0;
  for (vector<long long> V : DP[N])
    for (long long T : V)
      Ans = max(Ans, T);
  cout << Ans << endl;
}