#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define vi vector <int>
#define sz(a) ((int) (a).size())
#define me(f, x) memset(f, x, sizeof(f))
#define uint unsig7ned int
#define ull unsigned long long 
#define i128 __int128
using namespace std;
const int N = 1e6 + 7;
int n;
ll a[N], b[N], c[N];
bool check(vector < pair < ll, ll > > vc) {
	sort(vc.begin(), vc.end());
	ll sum = 0;
	for(auto&p : vc) {
		sum += p.second;
		if(sum > p.first) 
			return 0;
	}
	return 1;
}
void Main() {
	cin >> n;
	L(i, 1, n) {
		cin >> a[i] >> b[i] >> c[i];
	}
	ll l = 0, r = 1e18, ans = -1;
	while(l <= r) {
		ll mid = (l + r) >> 1;
		ll suma = 0, sumb = 0;
		L(i, 1, n) {
			suma += a[i], sumb += b[i];
		}
		vector < pair < ll, ll > > A, B;
		L(i, 1, n) {
			if(a[i] <= b[i]) {
				A.emplace_back(sumb - b[i] - (mid / c[i]), b[i] - a[i]);
			}
		}
		L(i, 1, n) {
			if(a[i] > b[i]) {
				B.emplace_back(suma - a[i] - (mid / c[i]), a[i] - b[i]);
			}
		}
		if(check(A) && check(B)) ans = mid, r = mid - 1;
		else l = mid + 1;
	}
	ll suma = 0, sumb = 0;
	L(i, 1, n) {
		suma += a[i], sumb += b[i];
	}
	vector < pair < ll, ll > > A, B;
	L(i, 1, n) {
		if(a[i] <= b[i]) {
			A.emplace_back(sumb - b[i] - (ans / c[i]), i);
		}
	}
	L(i, 1, n) {
		if(a[i] > b[i]) {
			B.emplace_back(suma - a[i] - (ans / c[i]), i);
		}
	}
	sort(A.begin(), A.end());
	sort(B.begin(), B.end());
	reverse(B.begin(), B.end());
	for(auto&x : A)
		cout << x.second << ' ';
	for(auto&x : B)
		cout << x.second << ' ';
	cout << '\n';
}
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t; cin >> t; while(t--) Main();
	return 0;
}