n, W, D = map(int, input().split())
dp0 = [-1 << 60] * (W + 1)
dp1 = [-1 << 60] * (W + 1)
dp0[0] = 0
dp1[0] = 0

for _ in range(n):
    t, w, v = map(int, input().split())
    if t == 0:
        for i in range(W, w - 1, -1):
            dp0[i] = max(dp0[i], dp0[i - w] + v)
    else:
        for i in range(W, w - 1, -1):
            dp1[i] = max(dp1[i], dp1[i - w] + v)

ans = 0
for i in range(W + 1):
    for j in range(W - i + 1):
        if abs(i - j) <= D:
            ans = max(ans, dp0[i] + dp1[j])
print(ans)