#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cstring>
#include<cassert>
#include<cstdio>
#include<cctype>
#include<vector>
#include<bitset>
#include<random>
#include<ctime>
#include<queue>
#include<cmath>
#include<list>
#include<map>
#include<set>
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long,long long>
#define FF fflush(stdout)
#define inf 0x3f3f3f3f
#define endl "\n"
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
//char buf[1<<20],*p1,*p2;
//#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<20,stdin),p1==p2)?EOF:*p1++)
inline int read()
{
    int s=0,f=1;
    char x=getchar();
    while(!isdigit(x))f=(x=='-'?-1:1),x=getchar();
    while(isdigit(x))s=s*10+x-'0',x=getchar();
    return s*f;
}
const int p=1e9+7;
//ll ksm(int a,int b){ll ans=1,bs=a;while(b){if(b&1)ans=ans*bs%p;bs=bs*bs%p;b>>=1;}return ans;}
mt19937 rd(time(0));
#define reaD read
vector<pii> A,B;
int a[100005],b[100005],c[100005];
int main()
{
    int T=reaD();
    while(T--)
    {
        int n=reaD();
        long long s=0;
        for(int i=1;i<=n;i++)
        {
            a[i]=read(),b[i]=read(),c[i]=read();
            s+=min(a[i],b[i]);
        }
        for(int i=1;i<=n;i++)
        {
            if(a[i]<=b[i])A.pb(mp(c[i]*s+c[i]*max(a[i],b[i]),i));
            else B.pb(mp(-(c[i]*s+c[i]*max(a[i],b[i])),i));
        }
        sort(A.begin(),A.end());
        sort(B.begin(),B.end());
        for(auto i:A)printf("%d ",i.se);
        for(auto i:B)printf("%d ",i.se);
        puts("");
        A.clear(),B.clear();
    }
   // system("pause");
    return 0;
}