import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

class SparseTable:
    def __init__(self, op, e, aa):
        self.op = op
        self.e = e
        self.w = w = len(aa)
        self.h = h = w.bit_length()
        table = [aa]+[[e() for _ in range(w)] for _ in range(h-1)]
        tablei1 = table[0]
        for i in range(1, h):
            tablei = table[i]
            for j in range(w-(1 << i)+1):
                rj = j+(1 << (i-1))
                tablei[j] = op(tablei1[j], tablei1[rj])
            tablei1 = tablei
        self.table = table

    # [l,r)の取得
    def prod(self, l, r):
        if l == r: return self.e()
        i = (r-l).bit_length()-1
        tablei = self.table[i]
        return self.op(tablei[l], tablei[r-(1 << i)])

n,W,D=LI()
ww=[[],[]]
vv=[[],[]]

for _ in range(n):
    t,w,v=LI()
    ww[t].append(w)
    vv[t].append(v)

dp=[[-inf]*(W+1),[-inf]*(W+1)]
dp[0][0]=dp[1][0]=0
for t in [0,1]:
    dpt=dp[t]
    for w,v in zip(ww[t],vv[t]):
        for i in range(W-w,-1,-1):
            if dpt[i]==-inf:continue
            dpt[i+w]=max(dpt[i+w],dpt[i]+v)

sp=SparseTable(max,lambda :-inf,dp[1])
ans=0
for i in range(W+1):
    l=max(0,i-D)
    r=min(i+D+1,W-i,W+1)
    if l>=r:continue
    cur=dp[0][i]+sp.prod(l,r)
    if cur>ans:ans=cur
print(ans)