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

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

for i in range(n):
    a,b,c=ns[i]
    for j in range(x+1):
        for k in range(y+1):
            if dp[i][j][k] == - 1:
                continue
            dp[i+1][j][k] = max(dp[i+1][j][k],dp[i][j][k])
            if a + j <= x and b + k <= y:
                dp[i+1][j + a][k + b] = max(dp[i+1][j + a][k + b],dp[i][j][k] + c)

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