import heapq

def solve():
    n = int(input())
    a = [0] * (n + 1)
    b = [0] * (n + 1)
    c = [0] * (n + 1)
    mp = [{} for _ in range(3)]
    ps = [{} for _ in range(3)]

    for i in range(1, n + 1):
        a[i], b[i], c[i] = map(int, input().split())
        for j, val in enumerate([a[i], b[i], c[i]]):
            if val not in ps[j]:
                ps[j][val] = []
            ps[j][val].append(i)
            mp[j][val] = mp[j].get(val, 0) + 1

    ans = [0] * n
    for i in range(1, n + 1):
        val = max(mp[0][a[i]], mp[1][b[i]], mp[2][c[i]])
        if val > 0:  # 防止val为0时访问ans[-1]
          ans[val-1]+=1

    for i in range(1,n):
      ans[i]+=ans[i-1]

    print(*ans)


t = int(input())
for _ in range(t):
    solve()