//Let's join Kaede Takagaki Fan Club !! #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //#include //#include #include #include #include #include #include #include #include #include //#include //#include //#include //#include //#include //#include using namespace std; //using namespace atcoder; #define int long long //#define L __int128 typedef long long ll; typedef pair P; typedef pair P1; typedef pair P2; #define pu push #define pb push_back #define eb emplace_back #define mp make_pair #define eps 1e-7 #define INF 1000000000 #define a first #define b second #define fi first #define sc second #define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define rep(i,x) for(int i=0;i=(int)(a);i--) #define per(i,b) gnr(i,0,b) #define repn(i,x) for(int i=1;i<=x;i++) #define SORT(x) sort(x.begin(),x.end()) #define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end()) #define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) #define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) #define all(x) x.begin(),x.end() #define si(x) (int)(x.size()) #define pcnt(x) __builtin_popcountll(x) #define all(x) x.begin(),x.end() #ifdef LOCAL #define dmp(x) cerr<<__LINE__<<" "<<#x<<" "< bool chmax(t&a,u b){if(a bool chmin(t&a,u b){if(b using vc=vector; template ostream& operator<<(ostream& os,const pair& p){ return os<<"{"< ostream& operator<<(ostream& os,const vc& v){ os<<"{"; for(auto e:v)os<> 30)) * 0xbf58476d1ce4e5b9; x = (x ^ (x >> 27)) * 0x94d049bb133111eb; return x ^ (x >> 31); } size_t operator()(uint64_t x) const { static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); return splitmix64(x + FIXED_RANDOM); } //don't make x negative! size_t operator()(pair x)const{ return operator()(uint64_t(x.first)<<32|x.second); } }; //unordered_set -> dtype, null_type //unordered_map -> dtype(key), dtype(value) using namespace __gnu_pbds; template using hash_table=gp_hash_table; template void o(const T &a,bool space=false){ cout << a << (space?' ':'\n'); } //ios::sync_with_stdio(false); const ll mod = 998244353; //const ll mod = 1000000007; mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count()); struct mint{ ll v; mint(ll vv=0){s(vv%mod+mod);} mint& s(ll vv){ v=vv>=1; } return res; } mint inv()const{return pow(mod-2);} friend mint operator+(ll x,const mint&y){ return mint(x)+y; } friend mint operator-(ll x,const mint&y){ return mint(x)-y; } friend mint operator*(ll x,const mint&y){ return mint(x)*y; } friend mint operator/(ll x,const mint&y){ return mint(x)/y; } friend ostream& operator<<(ostream&os,const mint&m){ return os<>(istream&is,mint&m){ ll x;is>>x; m=mint(x); return is; } bool operator<(const mint&r)const{return v0){ if(n&1) res=res*x%_md; x=x*x%_md; n>>=1; } return res; } #define _sz 1 mint F[_sz],R[_sz]; void make(){ F[0] = 1; for(int i=1;i<_sz;i++) F[i] = F[i-1] * i; R[_sz-1] = F[_sz-1].pow(mod-2); for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1); } mint C(int a,int b){ if(b < 0 || a < b) return mint(); return F[a]*R[b]*R[a-b]; } using ld=long double; using vi=vc; using ull=unsigned long long; /*int dst(P p, P q){ return (p.a-q.a)*(p.a-q.a)+(p.b-q.b)*(p.b-q.b); }*/ /*template void add_inplace(t &a, t b){ if(a.size() < b.size()) swap(a, b); for(int i=0;i= mod) a[i] -= mod; } return ; }*/ template void ov(const vc&a){ if(a.empty()) return; rep(i, si(a)) cout << a[i] << (i+1==si(a)?'\n':' '); } //o(ans?"Yes":"No"); int dp[5005][5005]; int n,m,a[5005],b[5005],c[5005]; void solve(){ cin>>n>>m; rep(i,n){ cin>>a[i]>>b[i]>>c[i]; } rep(a,5005) rep(b,5005) dp[a][b] = -1e18; dp[0][0] = 0; rep(i,n){ rep(j,m+1-a[i]){ if(dp[i][j] < 0) continue; chmax(dp[i+1][j+a[i]], b[i]*c[i]); } repn(j,m){ chmax(dp[i+1][j], dp[i+1][j-1]); if(j >= a[i]-b[i]) chmax(dp[i+1][j], dp[i+1][j-a[i]+b[i]]+b[i]*c[i]); } rep(j,m+1) chmax(dp[i+1][j], dp[i][j]); } repn(j,m) o(max(0LL,dp[n][j])); } signed main(){ cin.tie(0); ios::sync_with_stdio(0); cout<> t; while(t--) solve(); }