#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1e5 + 5;

ll T, n, S, a[N], b[N], c[N];

ll p[N], q[N];

vector <ll> vec1, vec2;

inline bool check(ll k) {
	vec1.clear();
	vec2.clear();
	for (int i = 1; i <= n; ++i) {
		p[i] = a[i] -  b[i];
		q[i] = k / c[i] - S + a[i];
		if (p[i] <= 0) {
			vec1.emplace_back(i);
		} else {
			vec2.emplace_back(i);
		}
	}
	sort(vec1.begin(), vec1.end(), [](ll x, ll y) {
		return q[x] > q[y];
	});
	sort(vec2.begin(), vec2.end(), [](ll x, ll y) {
		return q[x] - p[x] > q[y] - p[y];
	});
	ll t = 0;
	for (auto u: vec1) {
		if (t > q[u]) {
			return false;
		}
		t += p[u];
	}
	for (auto u: vec2) {
		if (t > q[u]) {
			return false;
		}
		t += p[u];
	}
	return true;
}

inline void print(ll k) {
	vec1.clear();
	vec2.clear();
	for (int i = 1; i <= n; ++i) {
		p[i] = a[i] -  b[i];
		q[i] = k / c[i] - S + a[i];
		if (p[i] <= 0) {
			vec1.emplace_back(i);
		} else {
			vec2.emplace_back(i);
		}
	}
	sort(vec1.begin(), vec1.end(), [](ll x, ll y) {
		return q[x] > q[y];
	});
	sort(vec2.begin(), vec2.end(), [](ll x, ll y) {
		return q[x] - p[x] > q[y] - p[y];
	});
	for (auto u: vec1) {
		cout << u << " ";
	}
	for (auto u: vec2) {
		cout << u << " ";
	}
	cout << "\n";
}

inline void solve() {
	cin >> n;
	S = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i] >> b[i] >> c[i];
		S += b[i];
	}
	ll l = 1, r = 2e18;
	while (l <= r) {
		ll mid = (l + r) >> 1;
		if (check(mid)) {
			r = mid - 1;
		} else {
			l = mid + 1;
		}
	}
	print(l);
}

int main() {
	#ifdef LOCAL
		assert(freopen("test.in", "r", stdin));
		assert(freopen("test.out", "w", stdout));
	#endif
	ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}