#include<bits/stdc++.h>
#define inf 1e9
#define eps 1e-6
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define db double
#define ve vector<int>
#define pa pair<int,int>
#define fr first
#define sd second
#define pb push_back
#define mp make_pair
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
inline ll read()
{
	char ch = getchar();
	ll s = 0, w = 1;
	while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
	return s * w;
}
#define N 100010
#define int ll
int n, m;
int a[N], b[N], c[N];
int A[N], B[N];
int sb[N];
int p[N];
bool cmp1(int x, int y) {return B[x] > B[y];}
bool cmp2(int x, int y) {return B[x] < B[y];}
int check(int W)
{
	for (int i = 1; i <= n; i ++)
	{
		A[i] = a[i] - b[i];
		B[i] = W / c[i] - sb[n] - b[i];
	}
	vector<int>P, Q;
		for (int i = 1; i <= n; i ++)if (A[i] <= 0)P.push_back(i); else Q.push_back(i);
	sort(P.begin(), P.end(), cmp1); sort(Q.begin(), Q.end(), cmp2);
	int tot = 0;
	for (int x : P)p[++ tot] = x; for (int x : Q)p[++ tot] = x;
	int sum = 0;
	// cout << "??:" << W << endl;
	// for (int i = 1; i <= n; i ++)cout << A[i] << ' '; cout << endl;
	// for (int i = 1; i <= n; i ++)cout << B[i] << ' '; cout << endl;
	for (int i = 1; i <= n; i ++)
	{
		sum += A[p[i]];
		if (sum > B[p[i]])return 0;
	}
	return 1;
}
void sol()
{
	cin >> n;
	for (int i = 1; i <= n; i ++)cin >> a[i] >> b[i] >> c[i];
	for (int i = 1; i <= n; i ++)sb[i] = sb[i - 1] + b[i];
	check(80);
	int l = 0, r = 1e18, ans = 1e18;
	while (l <= r)
	{
		int mid = (l + r) >> 1;
		if (check(mid))ans = mid, r = mid - 1;
		else l = mid + 1;
	}
	check(ans);
	// cout << ans << endl;
	for (int i = 1; i <= n; i ++)
	{
		cout << p[i];
		if (i == n)cout << '\n';
		else cout << ' ';
	}
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int T; cin >> T;
	while (T --)sol();
	return 0;
}