#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using ll = long long;
using Graph = vector<vector<int>>;

int main(){
    int n, x, y;
    cin >> n >> x >> y;
    vector<int> a(n+1);
    vector<int> b(n+1);
    vector<int> c(n+1);
    rep1(i, n){
        cin >> a[i] >> b[i] >> c[i];
    }

    vector<vector<vector<int>>> dp(n+1, vector<vector<int>>(x+1, vector<int>(y+1, -1)));
    dp[0][0][0] = 0;

    rep1(i, n) {
        for (int j = 0; j <= x; ++j) {
            for (int k = 0; k <= y; ++k) {
                if(dp[i-1][j][k] != -1) dp[i][j][k] = max(dp[i][j][k], dp[i-1][j][k]);
                if (j >= a[i] && k >= b[i] && dp[i-1][j - a[i]][k - b[i]] != -1)
                    dp[i][j][k] = max(dp[i][j][k], dp[i - 1][j - a[i]][k - b[i]] + c[i]);
            }
        }
    }

    int ans = 0;
    rep(i, x+1)rep(j, y+1){
        if(dp[n][i][j] != -1)
            ans = max(dp[n][i][j], ans);
    }

    cout << ans << endl;
}