#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j; i <= k; ++i)
#define repp(i,j,k) for(int i = j; i >= k;--i)
#define ll long long
int rd() {
	int x; scanf("%d",&x);
	return x;
}
int a[101000],b[101000],c[101000];
struct node{
	int d,id; double e;
}obj[101000];
int n;
ll B;
vector<int>ans;
bool cmp(node x,node y) {
	if( x.d <= 0 && y.d >= 0 ) return 1;
	else if( x.d >= 0 && y.d <= 0 ) return 0;
	else if( x.d < 0 && y.d < 0 ) return x.e > y.e;
	else return (x.e+x.d) < (y.e+y.d);
}
bool check(ll M) {
	rep(i,1,n) {
		obj[i].id = i;
		obj[i].d = a[i] - b[i];
		obj[i].e = 1.0*M/c[i] - B - a[i]; 
	}
	sort( obj+1 , obj+n+1 , cmp );
	ll res = 0;
	rep(i,1,n) {
		if( res > obj[i].e ) return false;
		res += obj[i].d;
	}
	return true;
}
void work() {
	B = 0;
	
	n = rd();
	rep(i,1,n) a[i] = rd() , b[i] = rd() , c[i] = rd() , B += b[i];
	ll l = 0 , r = 100000000000000000ll;
	while( l + 1 < r ) {
		ll mid = (l+r)>>1;
		if( check(mid) ) l = mid;
		else r = mid;
	}
	if( check(r) );
	else check(l);
	rep(i,1,n) printf("%d ",obj[i].id); printf("\n");
}
int main(){
	int T = rd();
	while(T--) work();
	return 0;
}