INF = 1 << 60

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

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

dp = [[- INF for _ in range(y + 1)] for _ in range(x + 1)]
dp[0][0] = 0
for ai, bi, ci in items:
  for i in range(x, ai - 1, -1):
    for j in range(y, bi - 1, -1):
      if dp[i - ai][j - bi] < 0:
        continue
      dp[i][j] = max(dp[i][j], dp[i - ai][j - bi] + ci)

ans = - INF
for i in range(x + 1):
  for j in range(y + 1):
    ans = max(ans, dp[i][j])

print(ans)