#include<bits/stdc++.h>

int main() {
	std::cin.tie(nullptr)->sync_with_stdio(false);

	int tests;
	std::cin >> tests;
	while (tests--) {
		int n, m;
		std::cin >> n >> m;
		std::vector<std::vector<int>> a(m, std::vector<int>(n));
		for (auto& i : a) {
			for (auto& j : i) std::cin >> j;
		}
		std::sort(a.begin(), a.end(), [&](auto& i, auto& j) {
			return std::accumulate(i.begin(), i.end(), 0ll) < std::accumulate(j.begin(), j.end(), 0ll);
		});
		std::vector<int64_t> sm(m);
		for (int j = 0; j < m; ++j) {
			sm[j] = std::accumulate(a[j].begin(), a[j].end(), 0ll);
		}
		std::vector<int> pair(n);
		for (int i = 0; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				if (a[1][j] < a[0][i]) continue;
				bool ok = true;
				for (int k = 2; k < m && ok; ++k) {
					int64_t ss = (a[1][j] - a[0][i]);
					ss *= (sm[k] - sm[0]);
					if (ss % (sm[1] - sm[0])) {
						ok = false;
						continue;
					}
					ss /= sm[1] - sm[0];
					ss += a[0][i];
					// std::cout << i << ' ' << j << ' ' << k << ' ' << ss << std::endl;
					ok &= std::binary_search(a[k].begin(), a[k].end(), ss);
				}
				if (ok) {
					pair[i] = j;
					break;
				}
			}
		}
		std::vector<int> p(n);
		iota(p.begin(), p.end(), 0);
		std::sort(p.begin(), p.end(), [&](int i, int j) {
			return std::pair{a[1][pair[i]] - a[0][i], a[0][i]} < std::pair{a[1][pair[j]] - a[0][j], a[0][j]};
		});
		std::vector<int> ret(n);
		for (int i = 0; i < n; ++i) ret[p[i]] = i;
		for (auto x : ret) std::cout << x + 1 << ' ';
		std::cout << '\n';
	}
}