#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define N 500
using namespace std;
const int inf=(int)(1e7);
int read()
{
	char c=0;
	int sum=0,f=1;
	while (c!='-'&&(c<'0'||c>'9')) c=getchar();
	if (c=='-') c=getchar(),f=-1;
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum*f;
}
int T,n,m,X[N+1][N+1],sX[N+1][N+1],p[N+1],num[N+1];
long long t[N+1],st[N+1];
bool cmp(int x,int y)
{
	return st[x]<st[y];
}
int main()
{
	long long b,d,ds;
	int ps,a;
	bool op;
	T=read();
	while (T--)
	{
		n=read(),m=read(),op=0;
		for (int i=1;i<=n;++i) num[i]=i;
		for (int i=1;i<=m;++i)
			for (int j=1;j<=n;++j)
				sX[i][j]=read()+inf;
		for (int i=2;i<=m;++i)
		{
			st[i]=0;
			for (int j=1;j<=n;++j) st[i]+=sX[i][j]-sX[1][j];
		}
		for (int i=1;i<=m;++i) p[i]=i;
		sort(p+1,p+m+1);
		for (int i=1;i<=m;++i)
		{
			t[i]=st[p[i]];
			for (int j=1;j<=n;++j) X[i][j]=sX[p[i]][j];
		}
		for (int i=1;i<=m-1;++i)
			if (t[i]==t[i+1])
				op=1;
		if (op)
		{
			for (int i=1;i<=n;++i) printf("%d ",i);
			puts("");
			continue;
		}
		for (int i=1;i<=n;++i)
		{
			a=-1,b=1,d=0;
			for (int j=2;j<=m;++j)
				for (int k=1;k<=n-i+1;++k)
				{
					ds=X[j][k]-((__int128)(X[j][k]-X[j-1][k])*t[j])/(t[j]-t[j-1]);
					if ((__int128)(X[j][k]-X[j-1][k])*b>(__int128)(a)*(t[j]-t[j-1])||((__int128)(X[j][k]-X[j-1][k])*b==(__int128)(a)*(t[j]-t[j-1])&&ds>d)) a=X[j][k]-X[j-1][k],b=t[j]-t[j-1],d=ds;
				}
			for (int j=1;j<=n;++j)
				if (X[1][j]==d)
				{
					p[num[j]]=n-i+1;
					break;
				}
			for (int j=1;j<=m;++j)
			{
			    ps=0;
				for (int k=1;k<=n-i+1;++k)
					if (X[j][k]==floor(d+((__int128)(t[j])*a)/b+0.5))
						ps=k;
				for (int k=ps;k<=n-i;++k) X[j][k]=X[j][k+1];
				if (j==1)
				{
					for (int k=ps;k<=n-i;++k) num[k]=num[k+1];
				}
			}
		}
		for (int i=1;i<=n;++i) printf("%d ",p[i]);
		puts("");
	}
	return 0;
}