#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
bool chmax(T &a, const T b) {if(a<b) {a=b; return true;} else {return false;}}
template<typename T>
bool chmin(T &a, const T b) {if(a>b) {a=b; return true;} else {return false;}}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    int n, m;
    cin >> n >> m;
    vi a(n), b(n), c(n);
    FOR(n) cin >> a[i] >> b[i] >> c[i];
    vvi score(n, vi(m+1));
    rep(i, n) rep(j, m+1) score[i][j] = (j/a[i])*b[i]*c[i] + score[i][(j/a[i])*b[i]+j%a[i]];
    repi(i, 1, m+1) {
        int mx = -INF;
        rep(j, n) chmax(mx, score[j][i]);
        cout << mx << endl;
    }
    // vvi dp(2, vi(m+1, 0));
    // rep(i, n) {
    //     int cur = i&1;
    //     int nxt = 1-cur;
    //     dp[nxt] = dp[cur];
    //     rep(j, m+1) {
    //         int pj = a[i];
    //         while(j+pj <= m) {
    //             chmax(dp[nxt][j+pj], dp[nxt][j] + score[i][pj]);
    //             pj *= a[i];
    //         }
    //     }
    //     repi(j, 1, m+1) cout << dp[nxt][j] << " "; cout << endl;
    // }
    // repi(i, 1, m+1) cout << dp[n&1][i] << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}