n, x, y = map(int, input().split())
X = [list(map(int, input().split())) for _ in range(n)]

DP = [[-1 for _ in range(y + 1)] for _ in range(x + 1)]
DP[0][0] = 0
for i in range(n):
    NDP = [[-1 for _ in range(y + 1)] for _ in range(x + 1)]
    a, b, c = X[i]
    for j in range(x + 1):
        for k in range(y + 1):
            if DP[j][k] != -1:
                NDP[j][k] = max(NDP[j][k], DP[j][k])
                if j + a <= x and k + b <= y:
                    NDP[j + a][k + b] = max(NDP[j + a][k + b], DP[j][k] + c)
    DP = NDP
ans = 0
for i in range(x + 1):
    for j in range(y + 1):
        ans = max(ans, DP[i][j])
print(ans)