#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " == " << x << endl
#define el '\n'
typedef long long ll;
typedef long double ld;
const int mod = 1000000007;
const int inf = 2147483647;
const int N = 100020;
ll a[N], b[N], c[N], n;
ll B;
struct Data {
	ll d;
	ld e;
	int id;
} d[N];
vector<int> check(ll p) {
	ll sum = 0;
	vector<int> ans;
	ans.resize(n + 1);
	for (int i = 1; i <= n; i++) {
		d[i].d = a[i] - b[i];
		sum += d[i].d;
		d[i].e = p * 1.0 / c[i] - B + a[i];
		d[i].id = i;
	}
	sort(d + 1, d + n + 1, [&](const Data &x, const Data &y) {
		if (x.d < 0 && y.d < 0)
			return x.e > y.e;
		if (x.d < 0 || y.d < 0)
			return x.d < y.d;
		return x.d + x.e < y.d + y.e;
	});
	sum = 0;
	ll mx = 0;
	for (int i = 1; i <= n; i++) {
		ans[i] = d[i].id;
		sum += d[i].d;
		mx = max(mx, 1ll * c[i] * (B + sum + b[i]));
	}
	if (mx > p)
		ans[0] = -1;
	return ans;
}
void solve() {
	cin >> n;
	B = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i] >> c[i];
		B += b[i];
	}
	ll l = 1, r = 1e18;
	vector<int> now;
	while (l < r) {
		ll mid = (l + r) >> 1;
		now = check(mid);
		if (now[0] != -1)
			r = mid;
		else
			l = mid + 1;
	}
	now = check(r);
	for (int i = 1; i <= n; i++) {
		cout << now[i] << " ";
	}
	cout << el;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}