// Author: YE Minghan
#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include "templates/debug.h"
#else
#define dbg(...) (void)0
#define msg(...) (void)0
#endif
#define ll long long
#define endl '\n'
#define PB emplace_back
#define PPB pop_back
#define MP make_pair
#define ALL(Name) Name.begin(),Name.end()
#define PII pair<int,int>
#define VI vector<int>
#define GI greater<int>
#define fi first
#define se second

const int N=502;
int n,m;
array<ll,N>x[N];
vector<array<ll,N>>as[N];
unordered_map<ll,int>occ[N];
array<ll,N>ans[N];
int ord[N],rnk[N];
bool found;
void dfs(int dep)
{
	if(dep>n){found=1;throw 114514;}
	for(auto &j:as[dep])
	{
		bool ok=1;
		for(int k=2;k<=n+1;k++)
			if(!occ[k][j[k]]){ok=0;break;}
		if(ok)
		{
			for(int k=2;k<=n+1;k++)occ[k][j[k]]--;
			ans[dep]=j;
			dfs(dep+1);
			for(int k=2;k<=n+1;k++)occ[k][j[k]]++;
		}
	}
}

int main()
{
	ios::sync_with_stdio(false),cin.tie(nullptr);
	int _;cin>>_;while(_--)
{
	cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int k=min(n+1,i);
		x[k][0]=0;
		for(int j=1;j<=n;j++)cin>>x[k][j],x[k][0]+=x[k][j];
	}
	sort(x+1,x+n+2);
	if(x[1][0]==x[n+1][0])
	{
		for(int i=1;i<=n;i++)cout<<i<<" \n"[i==n];
		continue;
	}
	for(int i=1;i<=n;i++)assert(x[i][0]!=x[i+1][0]);
	for(int i=2;i<=n+1;i++)
		for(int j=1;j<=n;j++)occ[i][x[i][j]]++;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			if(x[1][i]>x[2][j])continue;
			bool ok=1;
			x[0][1]=x[1][i],x[0][2]=x[2][j];
			for(int k=3;k<=n+1;k++)
			{
				if((x[2][j]-x[1][i])*(x[k][0]-x[1][0])%(x[2][0]-x[1][0])){ok=0;break;}
				x[0][k]=x[1][i]+(x[2][j]-x[1][i])*(x[k][0]-x[1][0])/(x[2][0]-x[1][0]);
				if(x[0][k]>1e7||!occ[k].count(x[0][k])){ok=0;break;}
			}
			if(ok)as[i].PB(x[0]);
		}
	found=0;
	try{dfs(1);}catch(int){}
	assert(found);
	for(int i=1;i<=n;i++)ans[i][0]=ans[i][2]-ans[i][1];
	iota(ord+1,ord+n+1,1);
	sort(ord+1,ord+n+1,[&](int x,int y){return ans[x]<ans[y];});
	for(int i=1;i<=n;i++)rnk[ord[i]]=i;
	for(int i=1;i<=n;i++)cout<<rnk[i]<<" \n"[i==n];
}

	return 0;
}