#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=1.5e7+5,K=(1<<25)+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int n,a[N],b[N],c[N];
vector<int> i1,i2,i3;
int id[N],ih;
ll ti[N],sa[N],sb[N];
int CK(ll mid){
	int i;
	sort(i1.begin(),i1.end(),[&](int x,int y){return mid/c[x]-b[x]>mid/c[y]-b[y];});
	sort(i3.begin(),i3.end(),[&](int x,int y){return mid/c[x]-a[x]<mid/c[y]-a[y];});
	ih=0;for(int i:i1) id[++ih]=i;for(int i:i2) id[++ih]=i;for(int i:i3) id[++ih]=i;
	for(int i=1;i<=n;i++) sa[i]=sa[i-1]+a[id[i]];for(int i=n;i;i--) sb[i]=sb[i+1]+b[id[i]];
	ll ans=0;for(int i=1;i<=n;i++) ans=max(ans,c[id[i]]*(sa[i]+sb[i]));
	return ans<=mid;
}
void Solve(){
	int i,j;scanf("%d",&n);
	i1.clear();i2.clear();i3.clear();
	for(i=1;i<=n;i++){
		scanf("%d%d%d",&a[i],&b[i],&c[i]);
		if(a[i]<b[i]) i1.emplace_back(i);
		else if(a[i]==b[i]) i2.emplace_back(i);
		else i3.emplace_back(i);
	} 
	ll l=-1,r=2e17,mid;
	while(l+1<r) mid=l+r>>1,(CK(mid)?r:l)=mid;
	CK(r);
	for(i=1;i<=n;i++) printf("%d%c",id[i]," \n"[i==n]);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}