#include <iostream>
using namespace std;
using ll = long long;
ll inf = 1e18;

int N, M;
int A[5050], B[5050]; ll C[5050];
ll dp[5050][2], ndp[5050][2];
template<typename A, int N, typename T>
void Fill(A (&arr)[N], const T &val){
    fill((T*)arr, (T*)(arr + N), val);
}
template<typename T>
void chmax(T &a, T b){
    a = max(a, b);
}
int main(void){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    cin >> N >> M;
    for(int i = 0;i < N;i++)cin >> A[i] >> B[i] >> C[i];
    Fill(dp, -inf);
    Fill(ndp, -inf);
    dp[0][0] = 0;
    for(int i = 0;i < N;i++){
        for(int j = 0;j <= M;j++){
            for(int k = 0;k < 2;k++){
                int nm = j + A[i] - k * B[i];
                chmax(ndp[j][k], dp[j][k]);
                if(nm <= M){
                    chmax(ndp[nm][1], ndp[j][k] + B[i] * C[i]);
                }
            }
        }
        for(int j = 0;j <= M;j++){
            chmax(ndp[j][0], ndp[j][1]);
            ndp[j][1] = -inf;
        }
        swap(dp, ndp);
        Fill(ndp, -inf);
    }
    for(int i = 1;i <= M;i++){
        chmax(dp[i][0], dp[i - 1][0]);
    }
    for(int i = 1;i <= M;i++){
        cout << dp[i][0] << "\n";
    }
    return 0;
}