#include<bits/stdc++.h>

using namespace std;

#define int long long
#define pb push_back
#define F first 
#define S second 

const int mol=998244353;

vector<int>a[505], bb[505];
bool vis[505][505];
int sum[505], v[505], iuu[505], tsum[505];
int n, m;

bool ch(int d1, int d2, int pre){
    int p1=d1, p2=d2, p3=pre;
    for(int i=3;i<=m;i++){
        bool ok=0;
        for(int j=1;j<=n;j++){
            if(vis[i][j]) continue;
            if(a[i][j]>=a[i-1][pre]&&(a[i][j]-a[i-1][pre])*d2==d1*(sum[i]-sum[i-1])){
                d1=a[i][j]-a[i-1][pre], d2=sum[i]-sum[i-1], pre=j;
                ok=1;
                break;
            }
        }
        if(!ok) return 0;
    }
    d1=p1, d2=p2, pre=p3;
    vis[2][pre]=1;
    for(int i=3;i<=m;i++){
        for(int j=1;j<=n;j++){
            if(vis[i][j]) continue;
            if(a[i][j]>=a[i-1][pre]&&(a[i][j]-a[i-1][pre])*d2==d1*(sum[i]-sum[i-1])){
                d1=a[i][j]-a[i-1][pre], d2=sum[i]-sum[i-1], pre=j;
                vis[i][j]=1;
                break;
            }
        }
    }
    return 1;
}

void solve(){
    cin>>n>>m;
    vector<pair<int, int>>tt;
    for(int i=1;i<=m;i++){
        a[i].clear();sum[i]=0;
        a[i].resize(n+1);
        for(int j=1;j<=n;j++){
            vis[i][j]=0;
            int g;
            cin>>g;
            sum[i]+=g;
            a[i][j]=g;
        }
    }
    // for(int i=1;i<=m;i++) cerr<<sum[i]<<"\n";
    if(sum[2]-sum[1]==0){
        for(int i=1;i<=n;i++) cout<<i<<" ";cout<<"\n";
        return;
    }
    for(int i=1;i<=n;i++){
        int dif1, dif2;
        bool ok=0;
        for(int j=1;j<=n;j++){
            if(vis[2][j]) continue;
            if(a[2][j]-a[1][i]<0) continue;
            dif1=a[2][j]-a[1][i];
            dif2=sum[2]-sum[1];
            if(ch(dif1, dif2, j)) {
                v[i]=a[2][j]-a[1][i];
                ok=1;
                break;
            }
        }
        if(!ok) {
            assert(0);
        }
    }
    vector<pair<int, int>>ans;
    for(int i=1;i<=n;i++) ans.pb({v[i], i});
    sort(ans.begin(), ans.end());
    int pp=1;
    for(auto t: ans){
        iuu[t.S]=pp++;
    }
    for(int i=1;i<=n;i++) cout<<iuu[i]<<" ";cout<<"\n";
}


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