#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 100 + 5;
int n;
set<int> v[3][N];
struct node{
    int x, y, z;
}a[N];
bool vis[3][N];
vector<PII> q[N];
int main(){
    multitest(){
        read(n);
        _rep(i, 1, n){
            read(a[i].x, a[i].y, a[i].z);
            v[0][a[i].x].insert(i), v[1][a[i].y].insert(i), v[2][a[i].z].insert(i);
        }
        _rep(i, 1, n){
            if(!vis[0][a[i].x]) q[v[0][a[i].x].size()].pb({0, a[i].x}), vis[0][a[i].x] = 1;
            if(!vis[1][a[i].y]) q[v[1][a[i].y].size()].pb({1, a[i].y}), vis[1][a[i].y] = 1;
            if(!vis[2][a[i].z]) q[v[2][a[i].z].size()].pb({2, a[i].z}), vis[2][a[i].z] = 1;
        }
        int cur = 0;
        writes(cur);
        _rep(i, 1, n - 1){
            while(q[i].size()){
                int op = q[i].back().fi, u = q[i].back().se; q[i].pop_back();
                if(v[op][u].size() != i) continue;
                for(auto &j : v[op][u]){
                    if(max({v[0][a[j].x].size(), v[1][a[j].y].size(), v[2][a[j].z].size()}) <= i){
                        cur++, v[0][a[j].x].erase(j), v[1][a[j].y].erase(j), v[2][a[j].z].erase(j);
                        q[v[0][a[j].x].size()].pb({0, a[j].x});
                        q[v[1][a[j].y].size()].pb({1, a[j].y});
                        q[v[2][a[j].z].size()].pb({2, a[j].z});
                    }
                }
            }
            writes(cur);
        }
        puts("");
        _rep(i, 0, n) q[i].clear();
        _rep(i, 1, n){
            v[0][a[i].x].clear(), v[1][a[i].y].clear(), v[2][a[i].z].clear();
            vis[0][a[i].x] = vis[1][a[i].y] = vis[2][a[i].z] = 0;
        }
    }    
    return 0;
}