#include<bits/stdc++.h>
#define pll pair<long long,long long>
#define M 100005
#define fi first
#define se second
using namespace std;
int n,T,p[M];
long long al,ans;
pll gu[M]; 
struct node{long long a,b,c;}e[M];
bool ck(pll a,pll b){
	if(max(a.se,b.se)<=0) return a.fi<b.fi;
	if(min(a.se,b.se)<=0) return a.se<=0;
	return a.fi+a.se<b.fi+b.se; 
}
bool ck(long long C){
	for(int i=1;i<=n;++i) gu[i]=make_pair((C/e[i].c)-e[i].a-al,e[i].a-e[i].b);
	sort(gu+1,gu+n+1,[](auto x,auto y){return ck(x,y);});
	long long nw=0;
	for(int i=1;i<=n;++i){if(nw>gu[i].fi) return 1;nw+=gu[i].se;}
	return 0;
}
int main(){
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);al=0;
		for(int i=1;i<=n;++i) scanf("%lld%lld%lld",&e[i].a,&e[i].b,&e[i].c),al+=e[i].b;
		long long l=1,r=1e18;
		while(l<=r){
			long long mid=(l+r)>>1;
			if(ck(mid)) l=mid+1;
			else r=mid-1,ans=mid;
			// printf("%lld %lld\n",l,r);
		}
		for(int i=1;i<=n;++i) p[i]=i;
		sort(p+1,p+n+1,[](int a,int b){return ck(make_pair(ans/e[a].c-e[a].c-al,e[a].a-e[a].b),make_pair(ans/e[b].c-e[b].c-al,e[b].a-e[b].b));});
		for(int i=1;i<=n;++i) printf("%d ",p[i]);printf("\n");
	}
	return 0;
}
// (C/c[i])-a[i]-sum1~n(b[j])>=sum1~i-1(a[j]-b[j]);