#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using i128 = __int128_t;

bool operator<(pair<ll, ll> a, pair<ll, ll> b) {
    return (i128)a.second * b.first < (i128)a.first * b.second;
}
void solve() {
    int n, m;
    cin >> n >> m;
    vector x(m, vector<ll>(n + 1));
    vector pos(m, unordered_map<ll, int>());
    for(int i = 0; i < m; i++) {
        for(int j = 0; j < n; j++) {
            cin >> x[i][j];
            pos[i][x[i][j]] = j;
            x[i][n] += x[i][j];
        }
    }
    if(m == 2) {
        cout << "1\n";
        return;
    }
    sort(x.begin(), x.end(), [&](vector<ll> &a, vector<ll> &b) {
        return a[n] < b[n];
    });
    ll sv = 0;
    for(int i = 1; i < m; i++) {
        sv = __gcd(sv, x[i][n] - x[0][n]);
    }
    vector<ll> t(m);
    for(int i = 0; i < m; i++) {
        t[i] = (x[i][n] - x[0][n]) / sv;
    }
    vector vis(m, vector(n, 0));
    vector<pair<pair<ll, ll>, int>> v(m);
    for(int _ = 0; _ < n; _++) {
        vector y(m, ll(1e9));
        for(int i = 0; i < m; i++) {
            for(int j = 0; j < n; j++) {
                if(!vis[i][j]) y[i] = min(y[i], x[i][j]);
            }
        }
        auto chk = [&](pair<ll, ll> a, pair<ll, ll> b) {
            return a.second * b.first == a.first * b.second;
        };
        ll x0 = -1e9;
        pair<ll, ll> vel;
        for(int i = 1; i + 1 < m; i++) {
            pair<ll, ll> l = {t[i] - t[i - 1], y[i] - y[i - 1]};
            pair<ll, ll> r = {t[i + 1] - t[i], y[i + 1] - y[i]};
            if(chk(l, r)) {
                auto [dx, dy] = l;
                vel = l;
                x0 = y[i] - dy * t[i] / dx;
                break;
            }
        }
        int id = -1;
        for(int i = 0; i < n; i++) if(x[0][i] == x0) id = i;
        auto [dx, dy] = vel;
        v[id] = {vel, id};
        for(int i = 0; i < m; i++) {
            ll y = x0 + dy * t[i] / dx;
            vis[i][pos[i][y]] = 1;
        }
    }
    for(int i = 0; i < n; i++) {
        for(int j = 0; j + 1 < n; j++) {
            if(v[j + 1].first < v[j].first) {
                swap(v[j], v[j + 1]);
            }
        }
    }
    vector<int> ans(n);
    for(int i = 0; i < n; i++) ans[v[i].second] = i;
    for(int i = 0; i < n; i++) {
        cout << ans[i] + 1 << " \n"[i == n - 1];
    }
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}