#include <iostream>
using namespace std;

const long long INF = 1000000000000LL;

int main() {
    int N, X, Y;
    cin >> N >> X >> Y;
    long long dp[301][301];
    
    for (int i = 0; i <= X; ++i) {
        for (int j = 0; j <= Y; ++j) {
            dp[i][j] = -INF;
        }
    }
    dp[0][0] = 0;
    
    for (int i = 0; i < N; ++i) {
        int a, b;
        long long c;
        cin >> a >> b >> c;
        for (int x = X; x >= a; --x) {
            for (int y = Y; y >= b; --y) {
                if (dp[x - a][y - b] + c > dp[x][y]) {
                    dp[x][y] = dp[x - a][y - b] + c;
                }
            }
        }
    }
    
    long long ans = 0;
    for (int x = 0; x <= X; ++x) {
        for (int y = 0; y <= Y; ++y) {
            if (dp[x][y] > ans) {
                ans = dp[x][y];
            }
        }
    }
    
    cout << ans << endl;
    return 0;
}