#include <bits/stdc++.h>
using namespace std;

using llf = long double;

struct MinCostFlow {
    using Cap = int;
    using Wei = int64_t;
    using PCW = pair<Cap, Wei>;
    static constexpr Cap INF_CAP = 1 << 30;
    static constexpr Wei INF_WEI = 1LL << 60;
private:
    struct Edge {
        int to, back;
        Cap cap;
        Wei wei;
        Edge() {}
        Edge(int a, int b, Cap c, Wei d) : to(a), back(b), cap(c), wei(d) {}
    };
    int ori, edd;
    vector<vector<Edge>> G;
    vector<int> fa, wh;
    vector<bool> inq;
    vector<Wei> dis;
    PCW SPFA() {
        fill(inq.begin(), inq.end(), false);
        fill(dis.begin(), dis.end(), INF_WEI);
        queue<int> qq; qq.push(ori);
        dis[ori] = 0;
        while (not qq.empty()) {
            int u = qq.front(); qq.pop();
            inq[u] = false;
            for (int i = 0; i < (int)G[u].size(); i++) {
                Edge e = G[u][i];
                int v = e.to; Wei d = e.wei;
                if (e.cap <= 0 || dis[v] <= dis[u] + d)
                    continue;
                dis[v] = dis[u] + d;
                fa[v] = u;
                wh[v] = i;
                if (inq[v]) continue;
                qq.push(v);
                inq[v] = true;
            }
        }
        if (dis[edd] == INF_WEI)
            return { -1, -1 };
        Cap mw = INF_CAP;
        for (int i = edd; i != ori; i = fa[i])
            mw = min(mw, G[fa[i]][wh[i]].cap);
        for (int i = edd; i != ori; i = fa[i]) {
            auto &eg = G[fa[i]][wh[i]];
            eg.cap -= mw;
            G[eg.to][eg.back].cap += mw;
        }
        return { mw, dis[edd] };
    }
public:
    void init(int n) {
        G.clear(); G.resize(n);
        fa.resize(n);
        wh.resize(n);
        inq.resize(n);
        dis.resize(n);
    }
    void add_edge(int st, int ed, Cap c, Wei w) {
        G[st].emplace_back(ed, G[ed].size(), c, w);
        G[ed].emplace_back(st, G[st].size()-1, 0, -w);
    }
    PCW solve(int a, int b) {
        ori = a, edd = b;
        Cap cc = 0;
        Wei ww = 0;
        vector<int64_t> res{0};
        while (true) {
            PCW ret = SPFA();
            if (ret.first == -1) break;
            cc += ret.first;
            ww += ret.first * ret.second;
            for (int i = 0; i < ret.first; i++) {
                res.push_back(res.back() + ret.second);
            }
        }

        for (size_t i = 1; i < res.size(); i++)
            cout << res[i] << (i + 1 == res.size() ? '\n' : ' ');

        return { cc, ww };
    }
} mcmf;


int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t; cin >> t;
    while (t--) {
        int n, m;
        cin >> n >> m;
        map<int,int> mp;
        int tot = 0;
        const auto getid = [&](int x) -> int {
            if (mp.count(x))
                return mp[x];
            return mp[x] = tot++;
        };
        vector<tuple<int,int,int64_t>> eds;
        for (int i = 0; i < n; i++) {
            int64_t a, b, c;
            cin >> a >> b >> c;
            int x = round(-b / llf(2 * a));
            for (int64_t y = -26 + x; y <= 26 + x; y++) {
                if (1 <= y && y <= m) {
                    int j = getid(y);
                    eds.emplace_back(i, j, a*y*y+b*y+c);
                }
            }
        }
        
        mcmf.init(n + tot + 2);
        int S = n + tot, T = S + 1;
        for (int i = 0; i < n; i++) {
            mcmf.add_edge(S, i, 1, 0);
        }
        for (auto [x, y, w]: eds) {
            mcmf.add_edge(x, y + n, 1, w);
        }
        for (int i = 0; i < tot; i++) {
            mcmf.add_edge(n + i, T, 1, 0);
        }
        mcmf.solve(S, T);
        // cout << mcmf.solve(S, T).second << '\n';
    }
    return 0;
}