# 3次元dp、ナップザック
# dp[i個目まで][メニューj][容量k]での最高のかわいさ
# 事前ソートは必要ないと思う

N, X, Y = map(int, input().split())
ABC = []
for i in range(N):
    a, b, c = map(int, input().split())
    ABC.append([a, b, c])

dp = [[[0]*(Y+1) for j in range(X+1)] for i in range(N+1)]
dp[0][0][0] = 0

for i in range(1, N+1):
    a, b, c = ABC[i-1]
    # not using
    for j in range(X+1):
        for k in range(Y+1):
            dp[i][j][k] = max(dp[i][j][k], dp[i-1][j][k])
            #dp[i][j][k] = dp[i-1][j][k]
    # using
    for j in range(X+1):
        for k in range(Y+1):
            if j+a <= X and k+b <= Y:
                dp[i][j+a][k+b] = max(dp[i][j+a][k+b], dp[i-1][j][k]+c)
    #print(dp[i])
                    
ans = 0
for j in range(X+1):
    for k in range(Y+1):
        ans = max(ans, dp[N][j][k])
print(ans)