#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+10;
int n,S,f[N];
struct node {
	int a,b,c,d,id;
	long double e;
	bool operator < (const node &x) const {
		if((d<0) ^ (x.d<0)) return d<x.d;
		if((d<0) && (x.d<0)) return e>x.e;
		return d+e<x.d+x.e;
	}
} p[N];

bool check(int T) {
	for(int i=1;i<=n;i++)
		p[i].e=T/p[i].c-p[i].b-S;
	sort(p+1,p+n+1);
	for(int i=1;i<=n;i++) f[i]=p[i].id;
	int sum=0;
	for(int i=1;i<=n;i++) {
		sum+=p[i].d;
		if(sum-p[i].e>0) return false;
	}
	return true;	
}

void solve() {
	scanf("%lld",&n);
	for(int i=1;i<=n;i++) {
		scanf("%lld%lld%lld",&p[i].a,&p[i].b,&p[i].c);
		S+=p[i].b;p[i].d=p[i].a-p[i].b;
		p[i].id=i;
	}
	int l=1,r=1e18,ans;
	while(l<=r) {
		int mid=(l+r)>>1;
		if(check(mid)) r=mid-1,ans=mid;
		else l=mid+1;
	}
	check(ans);
	if(n>=100) cout<<ans<<" ";
	for(int i=1;i<=n;i++) cout<<f[i]<<" "; cout<<"\n";
}

void init() {
	S=0;
}
signed main() {
	int T;scanf("%lld",&T);
	while(T--) {
		init(); solve();
	}
	return 0;
}