import heapq

N, X, Y = map(int, input().split())
dp = [[-1] * (Y + 1) for _ in range(X + 1)]
dp[0][0] = 0
for _ in range(N):
    A, B, C = map(int, input().split())
    for i in range(X - A, -1, -1):
        for j in range(Y - B, -1, -1):
            if dp[i][j] != -1:
                dp[i + A][j + B] = max(dp[i + A][j + B], dp[i][j] + C)

max_heap = []
for i in range(X + 1):
    for j in range(Y + 1):
        if dp[i][j] != -1:
            heapq.heappush(max_heap, -dp[i][j])

ans = -heapq.heappop(max_heap)
print(ans)