#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int n, m;
	cin >> m >> n;
	vector<int> a(m);
	vector<int> b(m);
	vector<long long> c(m);
	rep(i, m) cin >> a[i] >> b[i] >> c[i];
	using P = pair<long long, int>;
	vector<vector<P>> f(n + 1, vector<P>(m));
	vector<long long> g(n + 1);
	for(int i = 1; i <= n; i++){
		rep(j, m){
			auto [val, rest] = f[i - 1][j];
			rest++;
			if(rest >= a[j]){
				val += b[j] * c[j];
				rest = b[j];
			}
			f[i][j] = {val, rest};
			chmax(g[i], val);
		}
		for(int i2 = 0; i2 < i; i2++){
			chmax(g[i], g[i2] + g[i - i2]);
		}
		cout << g[i] << "\n";
	}
//	cout << f;
	return 0;
}