#include "bits/stdc++.h"
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()
#define int long long

const int mxn = 505;

int n,m;
vector<vector<int>> x;
vector<int> su;
vector<pair<long double,int>> pt;
int pos[mxn];

void solve() {
	cin>>n>>m; x.resize(m); su.resize(m);
	for (int i=0; i<m; i++) {
		x[i].resize(n);
		su[i] = 0;
		for (int j=0; j<n; j++) {
			cin>>x[i][j];
			su[i] += x[i][j];
		}
		sort(all(x[i]));
	}
		
	for (int i=0; i<n; i++) {
		int cx = x[0][0];
		int cy = su[0];
			
		int te = -69420;
		
		for (int nx : x[1]) {
			int ny = su[1];
			int ok=1;
//			cout<<cx<<" "<<cy<<"  "<<nx<<" "<<ny<<endl;
			for (int j=2; j<m; j++) {
				int y = su[j];
				int vv = (nx-cx)*(y-cy);
//				cout<<vv<<endl;
				if (vv%(ny-cy)==0) {
					vv/=(ny-cy);
					vv+=cx;
				} else {
					ok = 0;
					break;
				}
				if (binary_search(all(x[j]),vv)) {
					continue;
				} else {
					ok = 0;
				}
			}
			if (ok) {
				x[0].erase(find(all(x[0]),cx));
				te = nx;
				
				for (int j=2; j<m; j++) {
					int y = su[j];
					int vv = (nx-cx)*(y-cy)/(ny-cy);
					x[j].erase(lower_bound(all(x[j]),vv));
				}
				
				pt.push_back({(nx-cx)/1.0/(ny-cy),i});
				break;
			}
		}
	//	cout<<cx<<endl;
	//	cout<<te<<endl;
		x[1].erase(find(all(x[1]),te));
	}
	sort(all(pt));
	for (int i=0; i<sz(pt); i++) {
		pos[pt[i].second] = i+1;
	}
	pt.clear();
	for (int i=0; i<n; i++) {
		cout<<pos[i]<<" ";
	}
	cout<<"\n";
	
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int t; cin>>t;
	while (t--) {
		solve();
	}
}