#include #include using namespace std; int main() { int N, X, Y; cin >> N >> X >> Y; vector> dp(X + 1, vector(Y + 1, -1)); dp[0][0] = 0; for (int k = 0; k < N; k++) { int A, B, C; cin >> A >> B >> C; for (int i = X - A; i >= 0; i--) { for (int j = Y - B; j >= 0; j--) { if (dp[i][j] != -1) { dp[i + A][j + B] = max(dp[i + A][j + B], dp[i][j] + C); } } } } int ans = 0; for (int i = 0; i <= X; i++) { for (int j = 0; j <= Y; j++) { if (dp[i][j] != -1) { ans = max(ans, dp[i][j]); } } } cout << ans << endl; return 0; }