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

dp = [[0]*(y+1) for i in range(x+1)]
for _ in range(n):
    a,b,c = map(int,input().split())

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

ans = 0
for i in dp:
    ans = max(ans,max(i))
print(ans)