#include<bits/stdc++.h>
using namespace std;
int S,T;
#define ll long long
int c=1,head[8010],to[101000],nxt[101000],flow[101000];
ll ct[101000];
void ad(int u,int v,ll w){
	to[++c]=v,nxt[c]=head[u],flow[c]=1,ct[c]=w,head[u]=c;
	to[++c]=u,nxt[c]=head[v],flow[c]=0,ct[c]=-w,head[v]=c;
}
ll d[8010];
int pr1[8010],pr2[8010];
bool vis[8010];
const ll I=1e18;
bool spfa(){
	queue<int>q;q.push(S),vis[S]=1;
    for(int i=1;i<=T;i++)d[i]=I;
	d[S]=0;
	while(!q.empty()){
		int u=q.front();q.pop(),vis[u]=0;
		for(int i=head[u];i;i=nxt[i])if(flow[i]&&d[to[i]]>d[u]+ct[i]){
			d[to[i]]=d[u]+ct[i],pr1[to[i]]=u,pr2[to[i]]=i;
			if(!vis[to[i]])vis[to[i]]=1,q.push(to[i]);
		}
	}
	return d[T]<I;
}
ll ans;
void up(){
	ans+=d[T];
	int u=T;
	while(u!=S){
		int i=pr2[u];
		flow[i]--,flow[i^1]++,u=pr1[u];
	}
}
int n,R;
ll A[60],B[60],C[60],M[60],m,qc[10010];
void sol(){
    ans=0;
    scanf("%d%lld",&n,&m);
    R=0;
    for(int i=1;i<=n;i++){
        scanf("%lld%lld%lld",&A[i],&B[i],&C[i]);
        if(B[i]>0)M[i]=1;
        else{
            M[i]=max((-B[i])/(A[i]*2),1ll);
            M[i]=min(M[i],m);
        }
        for(ll j=max(1ll,M[i]-n-1);j<=min(m,M[i]+n+1);j++)qc[++R]=j;
    }
    sort(qc+1,qc+R+1);R=unique(qc+1,qc+R+1)-qc-1;
    S=n+R+1,T=S+1;c=1;
    for(int i=1;i<=T;i++)head[i]=0;
    for(int i=1;i<=n;i++)ad(S,i,0);
    for(int i=1;i<=R;i++)ad(n+i,T,0);
    for(int i=1;i<=n;i++)for(ll j=max(1ll,M[i]-n-1);j<=min(m,M[i]+n+1);j++){
        int p=lower_bound(qc+1,qc+R+1,j)-qc;
        ad(i,n+p,A[i]*j*j+B[i]*j+C[i]);
    }
    ans=0;
    for(int i=1;i<=n;i++)spfa(),up(),printf("%lld ",ans);puts("");
}
int main(){
    int T;scanf("%d",&T);while(T--)sol();
}