#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned long long;
const int N=5e2+10;
int T,n,m,a[N][N],cur[N],p[N],rk[N];
ll s[N];
bool find(int i,ll x){
	if(x>INT_MAX||x<INT_MIN)return 0;
	int k=lower_bound(a[i]+1,a[i]+1+n,x)-a[i];
	return k<=n&&a[i][k]==x;
}
bool chk(int i,int j){
	if(a[1][i]>a[2][j])return 0;
	for(int k=3;k<=m;k++){
		if((a[2][j]-a[1][i])*(s[k]-s[1])%(s[2]-s[1]))return 0;
		ll pos=a[1][i]+(a[2][j]-a[1][i])*(s[k]-s[1])/(s[2]-s[1]);
		if(!find(k,pos))return 0;
	}
	return 1;
}
void get(){
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		s[i]=0;
		for(int j=1;j<=n;j++)cin>>a[i][j],s[i]+=a[i][j];
	}
	static int vis[N];
	fill(vis,vis+1+n,0);
	for(int i=n;i>=1;i--){
		p[i]=0;
		for(int j=1;j<=n&&!p[i];j++)if(!vis[j]){
			if(chk(i,j))p[i]=j,vis[j]=1;
		}
	}
	// debug(ary(p,1,n));
	iota(cur,cur+1+n,0);
	sort(cur+1,cur+1+n,[&](int x,int y){
		return make_pair(a[2][p[x]]-a[1][x],a[1][x])<make_pair(a[2][p[y]]-a[1][y],a[1][y]);
	});
	for(int i=1;i<=n;i++)rk[cur[i]]=i;
	for(int i=1;i<=n;i++)cout<<rk[i]<<"\n "[i<n];
}
int main(){
	for(cin>>T;T--;)get();
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif