// 長い夜の終わりを信じながら
// Think twice, code once.
#include <set>
#include <vector>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

int T, n, dlt[100005];
int a[100005][3];
int cnt[100005][3];
vector<int> vec[100005][3];
set<pair<int, int>> s[3];

int getval(int id) {return max({cnt[a[id][0]][0], cnt[a[id][1]][1], cnt[a[id][2]][2]}) - 1;}

int main() {
	scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		for (int i = 1; i <= n; i++) {
			dlt[i] = 0;
			for (int j = 0; j < 3; j++) {
				scanf("%d", &a[i][j]);
				s[j].erase({cnt[a[i][j]][j], a[i][j]});
				s[j].emplace(++cnt[a[i][j]][j], a[i][j]);
				vec[a[i][j]][j].push_back(i);
			}
		}
		int ans = 0;
		for (int i = 0; i < n; i++) {
			// eprintf("k = %d\n", i);
			while (1) {
				int x = -1;
				for (int j = 0; j < 3; j++)
					if (!s[j].empty() && s[j].begin()->first <= i) {x = j; break;}
				if (x == -1) break;
				int id = s[x].begin()->second;
				s[x].erase(s[x].begin());
				for (int j : vec[id][x])
					if (!dlt[j] && getval(j) < i) {
						ans++;
						dlt[j] = 1;
						// eprintf("dlt: %d\n", j);
						for (int k = 0; k < 3; k++) {
							int flag = s[k].count({cnt[a[j][k]][k], a[j][k]});
							s[k].erase({cnt[a[j][k]][k], a[j][k]});
							cnt[a[j][k]][k]--;
							if (flag) s[k].emplace(cnt[a[j][k]][k], a[j][k]);
						}
					}
				vec[id][x].clear();
			}
			printf("%d ", ans);
		}
		puts("");
	}
	return 0;
}