#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std ;

const int N = 1e5+10;
long long sumb, summi[N];
int n;

struct Node{
	int a, b, c, id;
	int minus, con;
}a[N];

bool cmp(Node a, Node b){
	if(a.minus <= 0 && b.minus <= 0)
		return a.con > b.con;
	if(a.minus <= 0 || b.minus <= 0)
		return a.minus < b.minus;
	return a.con + a.minus < b.con + b.minus; 
}

bool judge(long long x){
	for(int i = 1 ; i <= n ; i++){
		a[i].con = sumb - a[i].a + x / a[i].c;
	}
	sort(a+1, a+n+1, cmp);
	
	long long summi = 0, maxx = 0;
	for(int i = 1 ; i <= n ; i++){
		summi + a[i].minus;
		long long temp = 1ll * a[i].c * (sumb + summi + a[i].b);
		if(temp > maxx)
			maxx = temp;
	} 
	return maxx <= x;
}

void solve(){
	memset(a, 0, sizeof(a));
	sumb = 0;
	cin >> n;
	for(int i = 1 ; i <= n ; i++){
		cin >> a[i].a >> a[i].b >> a[i].c;
		a[i].id = i;
		
		sumb += a[i].b ;
		a[i].minus = a[i].a - a[i].b;
	}
	
	
	long long l = 0, r = 1e18;
    while (l + 1 < r) {
        long long mid = l + (r - l) / 2;
        if (judge(mid))
            r = mid;
        else
            l = mid;
    }
	judge(r);
	for(int i = 1 ; i <= n ; i++){
		cout << a[i].id << " ";
	}
	cout << endl;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T; cin >> T;
	while(T--){
		solve();
	}
	return 0;
}