import sys
from collections import deque, Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
mod = 998244353

n, x, y = mi()

dp = [[0] * (y + 1) for _ in range(x + 1)]

for _ in range(n):
    e = [[0] * (y + 1) for _ in range(x + 1)]
    a, b, c = mi()
    for i in range(x + 1):
        for j in range(y + 1):
            e[i][j] = max(dp[i][j], e[i][j])
            if i + a <= x and j + b <= y:
                e[i + a][j + b] = max(dp[i][j] + c, e[i + a][j + b])
    dp = e
ans = 0
for i in range(x + 1):
    for j in range(y + 1):
        ans = max(ans, dp[i][j])

print(ans)