N,W,D = map(int, input().split())
zero_stone = []
one_stone = []
for i in range(N):
    t,w,v = map(int, input().split())
    if t == 0:
        zero_stone.append((w,v))

    else:
        one_stone.append((w,v))

dp0 = [[-1]*(W+1) for i in range(len(zero_stone)+1)]
dp0[0][0] = 0
for i in range(len(zero_stone)):
    w,v = zero_stone[i]
    for j in range(W+1):
        if dp0[i][j]!=-1:
            dp0[i+1][j] = max(dp0[i+1][j],dp0[i][j])
        if j+w<=W and dp0[i][j]!=-1:
            #print(i,j)
            dp0[i+1][j+w] = max(dp0[i+1][j+w],dp0[i][j]+v)
#print(dp0[-1])
dp1 = [[-1]*(W+1) for i in range(len(one_stone)+1)]
dp1[0][0] = 0
for i in range(len(one_stone)):
    w,v = one_stone[i]
    for j in range(W+1):
        if dp1[i][j]!=-1:
            dp1[i+1][j] = max(dp1[i+1][j],dp1[i][j])
        if j+w<=W and dp1[i][j]!=-1:
            dp1[i+1][j+w] = max(dp1[i+1][j+w],dp1[i][j]+v)
#print(dp1[-1])
ans = 0
for i in range(W+1):
    for j in range(W+1):
        if abs(i-j)<=D and i+j<=W:
            if dp0[-1][i] != -1 and dp1[-1][j] != -1:
                ans = max(ans,dp0[-1][i]+dp1[-1][j])
print(ans)