#include <bits/stdc++.h>

using namespace std;
void fast_io() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

int main() {
    fast_io();
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(n);
    vector<long long> c(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i] >> c[i];
    }
    const long long INF = 1e18;
    vector<vector<long long>> dp(n + 1, vector<long long>(m + 1, -INF));
    dp[0][0] = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= m; j++) {
            if (j <= m - a[i]) {
                dp[i + 1][j + a[i]] =
                    max(dp[i + 1][j + a[i]], dp[i][j] + b[i] * c[i]);
            }
        }
        for (int j = 0; j <= m; j++) {
            if (j + a[i] - b[i] <= m) {
                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 (int j = 0; j <= m; j++) {
            dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
        }
    }
    for (int j = 1; j <= m; j++) {
        dp[n][j] = max(dp[n][j], dp[n][j - 1]);
        cout << dp[n][j] << "\n";
    }
}