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

dp = [0] * (D + 1)
dp[0] = min(sum(v[i] for i in range(N) if t[i] == 0), sum(v[i] for i in range(N) if t[i] == 1))

for i in range(N):
    for x in range(D, t[i] * w[i] - 1, -1):
        dp[x] = max(dp[x], dp[x - t[i] * w[i]] + v[i])

ans = 0
for x in range(D + 1):
    if dp[x] + x <= W:
        ans = max(ans, dp[x])

print(ans)