#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define st first
#define nd second
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;

void solve() {
	int n; cin >> n;
	vector<ll> a(n), b(n), c(n);
	ll sm = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i] >> b[i] >> c[i];
		sm += min(a[i], b[i]);
	}
	ll tot = 0;
	for (int i = 0; i < n; i++)
		tot = max(tot, (sm + max(a[i], b[i])) * c[i]);
	vector<int> lh, rh;
	for (int i = 0; i < n; i++) {
		if (tot != (sm + max(a[i], b[i])) * c[i])
			continue;
		for (int j = 0; j < n; j++) {
			if (j == i) continue;
			if (a[j] <= b[j])
				lh.push_back(j);
			else
				rh.push_back(j);
		}
		sort(all(lh), [&](int x, int y) {
			return b[x] > b[y];
		});
		sort(all(rh), [&](int x, int y) {
			return b[x] < b[y];
		});
		lh.push_back(i);
		for (int j: rh)
			lh.push_back(j);
		for (int j = 0; j < n; j++)
			cout << lh[j] + 1 << " \n"[j + 1 == n];
		break;
	}
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int t; cin >> t; while (t--) solve();
}