n, x, y = map(int, input().split())

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

for i in range(n):
    a, b, c = map(int, input().split())
    for j in range(x, -1, -1):
        for k in range(y, -1, -1):
            if j + a <= x and b + k <= y:
                dp[j+a][k+b] = max(dp[j+a][k+b], dp[j][k] + c)

ans = 0
for d in dp:
    ans = max(ans, max(d))

print(ans)