N, W, D = map(int, input().split())
stones = [list(map(int, input().split())) for _ in range(N)]

dp = [[-1 for _ in range(2*W+1)] for _ in range(N+1)]
dp[0][W] = 0

for i in range(N):
    t, w, v = stones[i]
    for d in range(2*W+1):
        if dp[i][d] == -1:
            continue
        if d + (1 if t == 0 else -1) * w <= 2*W:
            dp[i+1][d+(1 if t == 0 else -1)*w] = max(dp[i+1][d+(1 if t == 0 else -1)*w], dp[i][d] + v)

answer = max([dp[N][W+d] for d in range(-D, D+1) if dp[N][W+d] != -1])

print(answer)