#include<stdio.h>

#include<iostream>

#include<string.h>

#include <stdlib.h>

#include<math.h>

#include<algorithm>

#include <queue>

using namespace std;

struct Kid{

    int id,v;

}kid[];

int a[];

int cmp(Kid a,Kid b){

    return a.v>b.v;

}

int main()

{

    int tcase;

    scanf("%d",&tcase);

    int t =;

    while(tcase--){

        int n;

        scanf("%d",&n);

        for(int i=;i<=n;i++){

            int a,b,c;

            scanf("%d%d%d",&a,&b,&c);

            kid[i].v = max(a,max(b,c));

            kid[i].id = i;

        }

        sort(kid+,kid++n,cmp);

        for(int i=;i<=n;i++){

            a[kid[i].id]=i;

        }

        for(int i=;i<n;i++){

            printf("%d ",a[i]);

        }

        printf("%d\n",a[n]);

    }

    return ;

}