N, M = map(int, input().split())
A, B, C = [0] * N, [0] * N, [0] * N
for i in range(N):
    A[i], B[i], C[i] = map(int, input().split())
INF = 1 << 63
dp = [[-INF] * (M + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
    for j in range(M + 1):
        if M >= j + A[i]:
            dp[i + 1][j + A[i]] = max(dp[i + 1][j + A[i]], dp[i][j] + B[i] * C[i])
    for j in range(M + 1):
        if M >= j + (A[i] - B[i]):
            dp[i + 1][j + A[i] - B[i]] = max(dp[i + 1][j + A[i] - B[i]], dp[i + 1][j] + B[i] * C[i])
    for j in range(M + 1):
        dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
ans = 0
for j in range(M + 1):
    ans = max(ans, dp[N][j])
    if j != 0:
        print(ans)