#include<bits/stdc++.h>
#define ll long long
#define maxn 1000010
using namespace std;
struct node{
	ll a,b,c,d,e;
	ll num;
}w[maxn];
bool cmp(node x,node y){
	if(x.d<=0&&y.d<=0)
		return x.e>y.e;
	else if(x.d<=0||y.d<=0)
		return x.d<y.d;
	else 
		return x.d+x.e<y.d+y.e;
}
void slove(){
	ll n,B=0;
	scanf("%lld",&n);
	for(ll i=1;i<=n;i++){
		scanf("%lld%lld%lld",&w[i].a,&w[i].b,&w[i].c);
		w[i].d=w[i].a-w[i].b;
		B+=w[i].b;
		w[i].num=i;
	}
	ll P;
	ll l=1,r=1000000000000000000ll;
	
	while(l+1<r){
		int temp=0;
		P=(l+r)/2;
	ll sumd=0;
	for(int i=1;i<=n;i++){
		if(sumd>w[i].e){
			temp=1;
			break;
		}
		sumd+=w[i].d;
	}
	if(temp) l=P;
	else r=P;
//	printf("%lld %lld %lld\n",P,l,r);
	}
	
//	printf("%lld\n",P);
		P=(l+r)/2;
	for(int i=1;i<=n;i++){
		w[i].e=P/w[i].c-B-w[i].a;
//		printf("%d %lld %lld %lld %lld %lld\n",i,w[i].a,w[i].b,w[i].c,w[i].d,w[i].e);
	}
	sort(w+1,w+n,cmp);
	
	for(int i=1;i<=n;i++){
		printf("%lld ",w[i].num);
	}
	printf("\n");
	return ;
}
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
	    slove();
	}
	return 0; 
}