#include <bits/stdc++.h>

using namespace std;

using i64 = long long;

void solve() {

	int n;
	cin >> n;

	vector cnt(3, vector(n + 1, 0));
	vector a(n + 1, array<int, 3>());
	for (int i = 1; i <= n; i ++) {
		for (int j = 0; j < 3; j ++) {
			int x;
			cin >> x;
			a[i][j] = x;
			cnt[j][x] ++;
		}
	}

	vector<int> has;
	for (int i = 1; i <= n; i ++) {
		auto [x, y, z] = a[i];
		has.emplace_back(max({cnt[0][x], cnt[1][y], cnt[2][z]}));
	}

	sort(has.begin(), has.end(), greater<>());

	for (int i = 0; i < n; i ++) {
		while (has.size() && has.back() <= i) {
			has.pop_back();
		}
		cout << n - has.size() << " \n"[i == n - 1];
	}

}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int t;
	cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}