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

V = [[-1 for i in range(W+1)] for t in range(2)]
V[0][0] = 0
V[1][0] = 0
for t in range(2):
  n = len(T[t])
  for i in range(n):
    w,v = T[t][i]
    for ww in range(W,-1,-1):
      if V[t][ww] == -1:
        continue
      if w + ww > W:
        continue
      V[t][w+ww] = max(V[t][w+ww],V[t][ww] + v)

ans = 0
for w in range(W+1):
  if V[0][w] == -1:
    continue
  for ww in range(W+1):
    if V[1][ww] == -1:
      continue
    if w + ww > W:
      break
    if abs(w - ww) > D:
      continue
    ans = max(ans,V[0][w] + V[1][ww])
print(ans)