#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<long long> dp(m + 1);
	rep(i, n) {
		int a, b;
		long long c;
		cin >> a >> b >> c;
		vector<long long>sdp(m + 1, -LINF);
		c *= b;
		b = a - b;
		rep(i, m - a + 1) sdp[i + a] = dp[i] + c;
		rep(i, m - b + 1)chmax(sdp[i + b], sdp[i] + c);
		rep(i, m + 1)chmax(dp[i], sdp[i]);
	}
	rep2(i, 1, m + 1)cout << dp[i] << endl;
	return 0;
}