//
n,m = map(int,input().split())
N = 25000
v =[0]N
w =[0]N
f =[0]N
cnt = 0
for i in range(1,n+1):
a,b,s = map(int,input().split())
k =1
while(k<=s):
cnt+=1
v[cnt] = ak
w[cnt] = bk
s-=k
k=2
if(s>0):
cnt+=1
v[cnt] = sa
w[cnt] = sb
n = cnt
for i in range(1,n+1):
for j in range(m,v[i]-1,-1):
f[j] = max(f[j],f[j-v[i]]+w[i])

print(f[m])

//