#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;

const int N = 505;

int n, m;

int x[N][N], v[N], p[N], r[N], uzeo[N];
ll t[N];

bool cmp(int A, int B) {
	if(v[A] != v[B]) return v[A] < v[B];
	return A < B;
}

void solve() {
	scanf("%d%d", &n, &m);
	for(int i = 0;i < n;i++) p[i] = i, uzeo[i] = 0;
	for(int i = 0;i < m;i++) {
		t[i] = 0;
		for(int j = 0;j < n;j++) {
			scanf("%d", &x[i][j]);
			t[i] += x[i][j];
		}
		if(i) t[i] -= t[0];
	}
	t[0] = 0;
	for(int i = 0;i < n;i++) {
		for(int j = 0;j < n;j++) {
			if(x[1][j] < x[0][i] || uzeo[j]) continue;
			int pom = x[1][j] - x[0][i], dobar = 1;
			for(int k = 2;k < m;k++) {
				ll uk = (ll)pom * t[k];
				if(uk % t[1] != 0) { dobar = 0; break; }
				ll novi = uk / t[1] + x[0][i];
				if(novi < -10000000 || novi > 10000000) { dobar = 0; break; }
				int ind = lower_bound(x[k], x[k] + n, (int)novi) - x[k];
				if(ind < 0 || ind >= n || x[k][ind] != novi) { dobar = 0; break; }	
			}
			if(dobar) {
				uzeo[j] = 1;
				v[i] = pom; break;
			}
		}
	}
	sort(p, p + n, cmp);
	for(int i = 0;i < n;i++)
		r[p[i]] = i;
	for(int i = 0;i < n;i++)
		printf("%d ", r[i] + 1);
	printf("\n");
}

int main() {
	int T; scanf("%d", &T);
	for(;T--;) solve();
	return 0;
}