#include <bits/stdc++.h>
using namespace std;
bool cmp(vector<int> x, vector<int> y) {
    long long xx = 0, yy = 0;
    for (int v : x) xx += v;
    for (int v : y) yy += v;
    return xx < yy;
}
struct node {
    int vu, vd, x;
    bool operator<(const node &rhs) const {
        long long op = vu * rhs.vd - vd * rhs.vu;
        if (op < 0) return 1;
        if (op > 0) return 0;
        return x < rhs.x;
    }
} points[505];
void solve() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> a(m, vector<int>(n, 0));
    vector<int> res(n);
    for (int i = 0; i < m; ++i)
        for (int j = 0; j < n; ++j) cin >> a[i][j];
    sort(a.begin(), a.end(), cmp);
    vector<long long> sum(m);
    for (int i = 0; i < m; ++i)
        for (int v : a[i]) sum[i] += v;
    for (int i = 1; i < m; ++i) {
        sum[i] -= sum[0];
    }
    sum[0] = 0;
    for (int i = 1; i < m; ++i) {
        if (sum[i] == sum[i - 1]) {
            for (int j = 1; j <= n; ++j) cout << j << (j == n ? '\n' : ' ');
            return;
        }
    }
    vector<int>::iterator ps[m];
    vector<int> pre = a[0];
    for (int i = 0; i < n; i++) {
        for (int j = 1; j < m; ++j) {
            bool flag = 1;
            for (int k = 0; k < m; ++k) {
                long long now = 1ll * (a[j].back() - a[j - 1].back()) * (sum[k] - sum[j]);
                if (now % (sum[j] - sum[j - 1])) {
                    flag = 0;
                    break;
                }
                now = a[j].back() + now / (sum[j] - sum[j - 1]);
                auto pos = lower_bound(a[k].begin(), a[k].end(), now);
                if (pos == a[k].end() || *pos != now) {
                    flag = 0;
                    break;
                }
                ps[k] = pos;
            }
            if (flag) {
                points[i].vu = a[j].back() - a[j - 1].back();
                points[i].vd = sum[j] - sum[j - 1];
                points[i].x = lower_bound(pre.begin(), pre.end(), *ps[0]) - pre.begin();
                for (int k = 0; k < m; ++k) a[k].erase(ps[k]);
                break;
            }
        }
    }
    sort(points, points + n);
    for (int i = 0; i < n; ++i) res[points[i].x] = i + 1;
    for (int i = 0; i < n; ++i) cout << res[i] << (i == n - 1 ? '\n' : ' ');
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
}