#include <bits/stdc++.h>
using namespace std;
#define N 210
int read(){
	int x=0,f=1;
	char ch=getchar();
	while (ch<'0' || ch>'9'){
		if (ch=='-') f=-1;
		ch=getchar();
	}
	while (ch>='0' && ch<='9'){
		x=x*10+ch-'0';ch=getchar();
	}
	return x*f;
}
class StableMatching{
public:
	int girl[N][N],boy[N][N];
	int girlc[N],boyc[N];
	int n,m;
	queue <int> q;
	int solve(){
		for (int i=1;i<=n;++i) boy[i][n+1]=0,boyc[i]=n+1,girlc[i]=1,q.push(i);
		while (!q.empty()){
			int G=q.front(),B=girl[G][girlc[G]];
			if (boy[B][boyc[B]]<boy[B][G]){
				q.pop();
				if (boyc[B]!=n+1){
					girlc[boyc[B]]++;
					q.push(boyc[B]);
				}
				boyc[B]=G;
			}else girlc[G]++;
		} 		
		for (int i=1;i<n;++i) printf("%d ",girl[i][girlc[i]]);
		printf("%d\n",girl[n][girlc[n]]);
	}
}GSA;
signed main(){
	int T=read();
	while (T --> 0){
		GSA.n=read();GSA.m=read();
		for (int i=1;i<=GSA.n;++i){
			int tot=0;
			for (int j=1;j<=GSA.m;++j){
				int x=read();
				if (x){
					GSA.girl[i][++tot]=x;
					GSA.boy[x][i]=j;
				}
			}
		}
		GSA.solve();
	}
	return 0;
}