#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

const int MAX = 1e5 + 10;

void solve() {
    int n;
    cin >> n;
    vector v(n, vector<int>(3));
    cin >> v;

    vector G(MAX, vector<vector<int>>(3));
    vector deg(MAX, vector<int>(3));
    vector<int> DEG(n, 3);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < 3; j++) {
            G[v[i][j]][j].emplace_back(i);
        }
    }
    vector alive(MAX, vector<bool>(3, true));
    set<tuple<int, int, int>> s;
    queue<int> que;
    for (int i = 0; i < MAX; i++) {
        for (int j = 0; j < 3; j++) {
            deg[i][j] = G[i][j].size();
            s.emplace(deg[i][j], i, j);
        }
    }
    for (int k = 0, cur = 0; k < n; k++) {
        while (not que.empty() or (not s.empty() and get<0>(*s.begin()) <= k)) {
            if (not que.empty()) {
                int i = que.front();
                que.pop();
                cur++;
                for (int j = 0; j < 3; j++) {
                    if (not alive[v[i][j]][j]) continue;
                    s.erase({deg[v[i][j]][j], v[i][j], j});
                    deg[v[i][j]][j]--;
                    s.emplace(deg[v[i][j]][j], v[i][j], j);
                }
            } else {
                auto [_, x, y] = *s.begin();
                s.erase(s.begin());
                assert(alive[x][y]);
                alive[x][y] = false;
                for (int i : G[x][y]) {
                    bool safe = false;
                    for (int j = 0; j < 3; j++) {
                        if (alive[v[i][j]][j]) {
                            safe = true;
                        }
                    }
                    if (not safe) que.emplace(i);
                }
            }
        }
        cout << cur << (k + 1 == n ? "\n" : " ");
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}