#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define pb push_back
#define ll long long

const int N=100050;
int a[N],b[N],c[N],d[N];

/*int Get(int i){
	if(a[i]<b[i])return 0;
	if(a[i]==b[i])return 1;
	return 2;
}
bool cmp(int i,int j){
	if(Get(i)!=Get(j))return Get(i)<Get(j);
	if(Get(i)==0){
		if(c[i]!=c[j])return c[i]<c[j];
		return b[i]-a[i]>b[j]-a[j];
	}else if(Get(i)==1){
		return false;
	}else{
		if(c[i]!=c[j])return c[i]>c[j];
		return a[i]-b[i]<a[j]-b[j];
	}
}*/
ll add;
bool cmp2(int i,int j){
	//if(c[i]!=c[j])return c[i]<c[j];
	//return d[i]>d[j];
	return (ll)(d[j]+add)*c[i]<(ll)(d[i]+add)*c[j];
}

const ll lim=1e18;
vector<int> Solve(vector<int> ord){
	ll top=lim,bot=0,ans;
	vector<int> best;
	while(top>=bot){
		ll mid=top+bot>>1;
		ll D=0;
		for(int i:ord)D+=d[i];
		vector<pair<ll,int>> A;
		for(int i:ord){
			ll X=(add+min(a[i],b[i])+D)*c[i];
			ll diff=X-mid;
			ll need=0;
			if(diff>0){
				need=(diff+c[i]-1)/c[i];
			}
			A.pb({need,i});
		}
		sort(A.begin(),A.end());
		ll now=0;
		bool ok=true;
		vector<int> B;
		for(int i=0;i<A.size();i++){
			if(now<A[i].first){
				ok=false;
			}
			now+=d[A[i].second];
			B.pb(A[i].second);
		}
		if(ok){
			top=mid-1;
			best=B;
		}else{
			bot=mid+1;
		}
	}
	return best;
}
int main(){
	int t;
	scanf("%i",&t);
	while(t--){
		int n;
		scanf("%i",&n);
		add=0;
		vector<int> ans,L,R;
		for(int i=1;i<=n;i++){
			scanf("%i %i %i",&a[i],&b[i],&c[i]);
			d[i]=abs(a[i]-b[i]);
			if(a[i]<b[i])L.pb(i);
			if(a[i]>b[i])R.pb(i);
			add+=min(a[i],b[i]);
		}

		L=Solve(L);
		R=Solve(R);
		reverse(R.begin(),R.end());

		for(int i:L)ans.pb(i);
		for(int i=1;i<=n;i++){
			if(d[i]==0)ans.pb(i);
		}
		for(int i:R)ans.pb(i);
		for(int i:ans)printf("%i ",i);
		printf("\n");
		/*printf(" ");
		for(int i=1;i<n;i++){
			if(!cmp2(ans[i-1],ans[i])){
				printf("=");
			}else{
				printf("<");
			}
			printf(" ");
		}
		printf("\n");*/
	}
	return 0;
}