#include <bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back
#define all1(x) (x).begin() + 1, (x).end()
#define all0(x) (x).begin(), (x).end()
typedef long long LL;
typedef pair<int, int> pi;

void solve() {
    int n; cin >> n;
    int m; cin >> m;
    V<V<int>> v(m + 1);
    V<map<int, int>> vmp(m + 1);
    V<multiset<int>> vst(m + 1);
    for(int i = 1; i <= m; i++) {
        v[i].resize(n + 1);
        for(int j = 1; j <= n; j++) cin >> v[i][j];
    }
    
    sort(v.begin() + 2, v.end(), [&](V<int> a, V<int> b){
        LL suma = accumulate(all1(a), 0LL);
        LL sumb = accumulate(all1(b), 0LL);
        return suma < sumb;
    });

    for(int i = 1; i <= m; i++) {
        v[i].resize(n + 1);
        for(int j = 1; j <= n; j++) vst[i].insert(v[i][j]), vmp[i][v[i][j]]++;
    }

    V<LL> sum(m + 1);
    for(int i = 1; i <= m; i++) {
        for(auto y : v[i]) sum[i] += y;
    }
    
    auto pos = [&](int x, int y, int pos) -> int {
        if(sum[2] == sum[1]) {
            if(x != y) return -1;
            return x;
        }

        LL tmp = 1LL * (y - x) * (sum[pos] - sum[1]);
        if(tmp % (sum[2] - sum[1])) return -1;
        return tmp / (sum[2] - sum[1]) + x;
    };

    int cnt = 0;

    V<set<int>> posibility(n + 1);
    V<map<int, V<pi>>> hav(m + 1);
    for(int i = 1; i <= n; i++) {
        int x = v[1][i];
        for(int j = 1; j <= n; j++) {
            int y = v[2][j];
            bool ok = 1;
            for(int k = 3; k <= m; k++) {
                if(!vst[k].count(pos(x, y, k))) {
                    ok = 0;
                    break;
                }
            }
            if(ok) {
                if(posibility[i].count(y)) continue;
                cnt++;
                posibility[i].insert(y);
                for(int k = 2; k <= m; k++) {
                    hav[k][pos(x, y, k)].pb({i, y});
                }
            }

        }   
    }

    assert(cnt < 2 * n);

    queue<int> que;
    for(int i = 1; i <= n; i++) {
        if(posibility[i].size() == 1) que.push(i);
    }

    V<int> ansto(n + 1);
    while(que.size()) {
        int i = que.front();
        que.pop();
        int x = v[1][i];
        int y = *posibility[i].begin();
        // cout << "(" << x << " " << y << ")" << endl;
        for(int k = 2; k <= m; k++) {
            vmp[k][pos(x, y, k)]--;
            if(vmp[k][pos(x, y, k)] == 0) {
                // cout << "at" << k << " " << pos(x, y, k) << endl;
                for(auto [a, b] : hav[k][pos(x, y, k)]) {
                    if(posibility[a].count(b)) {
                        posibility[a].erase(b);
                        // cout << "e " << a << " " << b << endl;
                        if(posibility[a].size() == 1) que.push(a);
                    }
                }
            }
        }
        ansto[i] = y;
    }


    V<int> ans(n + 1);
    iota(all1(ans), 1LL);
    sort(all1(ans), [&](int x, int y) -> bool {
        int nowx = v[1][x];
        int tox = ansto[x]; 
        int nowy = v[1][y];
        int toy = ansto[y]; 
        if(tox - nowx != toy - nowy) return tox - nowx < toy - nowy;
        return nowx < nowy;
    });

    V<int> tt = ans;

    for(int i = 1; i <= n; i++) {
        ans[tt[i]] = i;
    }

    for(int i = 1; i <= n; i++) {
        cout << ans[i] << " ";
    }
    cout << endl;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t; cin >> t;
    while(t--) solve();
}