n, v = map(int, input().split())
f = [0 for _ in range(v+1)]
for i in range(n):
b, w, s = map(int, input().split())
for j in range(v, -1, -1):
k = 1
while k <= s and j >= k * b:
f[j] = max(f[j], f[j - k*b] + k*w)
k += 1
print(f[v])