#include <iostream>
#include <cstdio>
#include <queue>
#include <map>
#include <vector>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 6005;
const int inf = 0x3f3f3f3f;
const long long infll = 0x3f3f3f3f3f3f3f3fll;

struct Edge {
	int to, val;
	long long cst;
	int rev;
	Edge (int _to = 0, int _val = 0, long long _cst = 0ll, int _rev = 0) :
		to(_to), val(_val), cst(_cst), rev(_rev) {}
};
vector<Edge> e[N];
void add(int u, int v, int w, long long c) {
	e[u].push_back(Edge(v, w, c, (int)e[v].size()));
	e[v].push_back(Edge(u, 0, -c, (int)e[u].size() - 1)); 
}

long long d[N] = {0};
int prx[N] = {0};
int idx[N] = {0};
bool inq[N] = {false}; 

bool BellmanFord(int s, int t) {
	memset(d, 0x3f, sizeof d);
	queue<int> q;
	q.push(s), d[s] = 0ll;
	while (!q.empty()) {
		int h = q.front();
		q.pop();
		inq[h] = false;
		for (int v = 0; v < (int)e[h].size(); v++) {
			Edge i = e[h][v];
			if (i.val > 0 && d[i.to] > d[h] + i.cst) {
				d[i.to] = d[h] + i.cst;
				prx[i.to] = h;
				idx[i.to] = v;
				if (!inq[i.to])
					inq[i.to] = true, q.push(i.to);
			}
		}
	}
	return d[t] != infll;
}

void SSP(int s, int t) {
	long long ans = 0ll;
	while (BellmanFord(s, t)) {
		ans += d[t];
		//????? 1
		for (int i = t; i != s; i = prx[i]) {
			e[prx[i]][idx[i]].val--;
			e[e[prx[i]][idx[i]].to][e[prx[i]][idx[i]].rev].val++;
		}
		printf("%lld ", ans);
	}
	printf("\n");
}

const int M = 55;
int n, m;
long long a[M] = {0}, b[M] = {0}, c[M] = {0};
vector<int> nxt[M];

long long cal(int i, int x) {
	return a[i] * x * x + b[i] * x + c[i];
}

map<int, int> mp;

void slv() {
	scanf("%d%d", &n, &m);
	mp.clear();
	for (int i = 1; i <= n; i++) {
		scanf("%lld%lld%lld", &a[i], &b[i], &c[i]);
		int l = 0, r = m;
		while (l + 1 < r) {
			int mid = (l + r) / 2;
			if (cal(i, mid) <= cal(i, mid + 1))
				r = mid;
			else 
				l = mid;
		}
		//l??n??r??n? 
		nxt[i].clear();
		for (int j = l; j >= l - n && j >= 1; j--)
			nxt[i].push_back(j), mp[j] = 1;
		for (int j = r; j <= r + n && j <= m; j++)
			nxt[i].push_back(j), mp[j] = 1; 
	}
	int tot = n;
	for (auto &i: mp) 
		i.second = ++tot;
	int S = 0, T = ++tot;
	for (int i = S; i <= T; i++)
		e[i].clear();
	for (int i = 1; i <= n; i++) {
		add(S, i, 1, 0);
		for (auto j: nxt[i])
			add(i, mp[j], 1, cal(i, j));
	}
	for (auto &i: mp)
		add(i.second, T, 1, 0);
	SSP(S, T);
}

int main()
 {
	int T;
	scanf("%d", &T);
	while (T--)
		slv(); 
	return 0;
}