N,X,Y = map(int, input().split())
dp = [[[0]*(Y+1) for _ in range(X+1)] for _ in range(N+1)]
ans = 0
for i in range(N):
    a,b,c = map(int, input().split())
    for j in range(X+1):
        for k in range(Y+1):
            dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k])
            if j+a <= X and k+b <= Y:
                dp[i+1][j+a][k+b] = max(dp[i+1][j+a][k+b], dp[i][j][k]+c)
            ans = max(ans, dp[i+1][j][k])
print(ans)