#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define pb push_back
#define mp make_pair

#define MAXN 510

int a[MAXN][MAXN];
bool taken[MAXN][MAXN];
double times[MAXN];

double velocity[MAXN];

map<int, vi> posmap[MAXN];

pair<pair<double, int>, int> dataa[MAXN];
int out[MAXN];

const double eps = 1e-8;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	cin.exceptions(cin.failbit);

	srand(130481);

	int t;
	cin >> t;
	while (t--) {
		int n, m;
		cin >> n >> m;
		rep(i, 0, n) velocity[i] = -1;
		rep(i, 0, m) posmap[i].clear();

		rep(i, 0, m) rep(j, 0, n) {
			cin >> a[i][j];
			posmap[i][a[i][j]].pb(j);
			taken[i][j] = false;
		}
		

		ll basedisplacement = 0;
		rep(j, 0, n) basedisplacement += a[1][j] - a[0][j];
		//cout << basedisplacement << endl;
		if (basedisplacement == 0) {
			rep(i, 0, n) cout << i+1 << ' ';
			cout << '\n';
			continue;
		}
		times[0] = 0;
		times[1] = 1;
		rep(i, 2, m) {
			ll displacement = 0;
			rep(j, 0, n) displacement += a[i][j] - a[0][j];
			times[i] = displacement / double(basedisplacement);
		}

		//rep(_, 0, n) {
			rep(pig, 0, n) {
				if (taken[0][pig]) continue;
				vector<double> speeds;

				rep(j, 0, n) {
					double cand = a[1][j] - a[0][pig];
					//cerr << "candidate " << cand << endl;
					int kills = 1;
					bool ok = true;

					rep(i, 1, m) {
						double neededpos = a[0][pig] + cand*times[i];
						int need = round(neededpos);
						if (fabs(need-neededpos) > eps) ok = false;

						//cerr << "needed pos " << need << endl;

						for (int x : posmap[i][need]) {
							//cerr << "look at " << x << endl;
							if (!taken[i][x]) {
								kills++;
								break;
							}
						}
					}
					if (kills != m) ok = false;
					if (ok) speeds.pb(cand);
				}
				if (speeds.empty()) {
					cerr << "bad" << endl;
					return 1;
				}

				bool last = true;
				rep(i, pig+1, n) if (velocity[i] != -1) last = false;

				if (true) {
					// lock in
					
					taken[0][pig] = true;
					double cand = speeds[0];
					velocity[pig] = cand;
					rep(i, 1, m) {
						double neededpos = a[0][pig] + cand*times[i];
						int need = round(neededpos);

						for (int x : posmap[i][need]) {
							if (!taken[i][x]) {
								taken[i][x] = true;
								break;
							}
						}
					}

					//break;
					
				}
			}
		//}

		rep(i, 0, n) dataa[i] = mp(mp(velocity[i], a[0][i]), i);
		sort(dataa, dataa+n);
		rep(i, 0, n) out[dataa[i].second] = i+1;
		rep(i, 0, n) cout << out[i] << ' ';
		cout << '\n';
		//cout << endl;
	}
}