#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
using namespace std;
const int N=55,N1=3005,M=20005;
typedef long long ll;
int TT,n,m,S,T,cnt,num;
ll a[N],b[N],c[N],cst[M];
int to[M],nxt[M],f[M],h[N1];
void add(int i,int x,int y,int z,ll w){
	to[i]=y;f[i]=z;nxt[i]=h[x];cst[i]=w;h[x]=i;
}
map<int,int>Map;
ll F(int i,int j){
	return a[i]*j*j+b[i]*j+c[i];
}
struct node{
	int val;ll key;
	bool operator<(const node a)const{
		return key>a.key;
	}
}d[N1],p;
int tot;
bool cmp(node x,node y){
	return x.key<y.key;
}
void get1(int i,int &l,int &r){
	if(2*a[i]>=-b[i]){
		l=1;r=n;
		return;
	}
	if(2*a[i]*m<=-b[i]){
		r=m;l=m-n+1;
		return;
	}
	tot=1;int t=-b[i]/(a[i]*2);
	d[1].val=t;d[1].key=F(i,t);
	for(int i=1;i<=n;i++){
		if(t-i>=1){
			tot++;
			d[tot].val=t-i;
			d[tot].key=F(i,t-i);
		}
		if(t+i<=m){
			tot++;
			d[tot].val=t+i;
			d[tot].key=F(i,t+i);
		}
	}
	sort(d+1,d+tot+1,cmp);
	l=m;r=1;
	for(int i=1;i<=n;i++){
		if(d[i].val<l) l=d[i].val;
		if(d[i].val>r) r=d[i].val;
	}
}
priority_queue<node>Q;
ll dis[N1];
int pre[N1];
bool vis[N1];
ll dfs(){
	memset(dis,0x3f,sizeof dis);
	memset(vis,0,sizeof vis);
	while(!Q.empty()) Q.pop();
	dis[S]=0;pre[S]=-1;
	p.val=S;p.key=0;Q.push(p);
	while(!Q.empty()){
		int x=Q.top().val;Q.pop();
		if(vis[x]) continue;
		vis[x]=true;
		if(x==T) return dis[T];
		for(int i=h[x],y;i;i=nxt[i]){
			y=to[i];
			if(vis[y]) continue;
			if(f[i] and dis[y]>dis[x]+cst[i]){
				dis[y]=dis[x]+cst[i];
				p.val=y;p.key=dis[y];
				Q.push(p);
				pre[y]=i;
			}
		}
	}
	return 0x3f3f3f3f3f3f3f3f;
}
void path(){
	for(int t=pre[T];~t;t=pre[to[t^1]]){
		f[t]--;f[t^1]++;
	}
}
int main(){
//	freopen("ex1.in","r",stdin);
	scanf("%d",&TT);
	while(TT--){
		scanf("%d%d",&n,&m);num=n;
		memset(h,0,sizeof h);
		for(int i=1;i<=n;i++){
			scanf("%lld%lld%lld",&a[i],&b[i],&c[i]);
		}
		Map.clear();cnt=1;
		ll mm=0x3f3f3f3f3f3f3f3f;
		for(int i=1,l,r,k;i<=n;i++){
			get1(i,l,r);
			for(int j=l;j<=r;j++){
				if(!Map[j]) Map[j]=++num;
				k=Map[j];ll w=F(i,j);
				add(++cnt,i,k,1,w);
				add(++cnt,k,i,0,-w);
				if(w<mi) mi=w;
			}
		}
		if(TT==6) printf("%lld\n",mi);
		S=num+1;T=S+1;
		for(int i=1;i<=n;i++){
			add(++cnt,S,i,1,0);
			add(++cnt,i,S,0,0);
		}
		for(int i=n+1;i<=num;i++){
			add(++cnt,i,T,1,0);
			add(++cnt,T,i,0,0);
		}
		ll ans=0;
		for(int i=1;i<=n;i++){
			ll k=dfs();
			if(k!=0x3f3f3f3f3f3f3f3f){
				ans+=k;path();
			}
			printf("%lld ",ans);
		}
		puts("");
	}
	return 0;
}

answer.code: In function ‘int main()’:
answer.code:110:38: error: ‘mi’ was not declared in this scope; did you mean ‘i’?
  110 |                                 if(w<mi) mi=w;
      |                                      ^~
      |                                      i
answer.code:113:43: error: ‘mi’ was not declared in this scope; did you mean ‘mm’?
  113 |                 if(TT==6) printf("%lld\n",mi);
      |                                           ^~
      |                                           mm
answer.code:94:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   94 |         scanf("%d",&TT);
      |         ~~~~~^~~~~~~~~~
answer.code:96:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   96 |                 scanf("%d%d",&n,&m);num=n;
      |                 ~~~~~^~~~~~~~~~~~~~
answer.code:99:30: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   99 |                         scanf("%lld%lld%lld",&a[i],&b[i],&c[i]);
      |                         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~