#include<bits/stdc++.h>
#define db double
#define LL long long
#define ldb long double
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define pli pair<LL,int>
#define pii pair<int,int>
#define pip pair<int,pii>
#define fr first
#define sc second
#define mp make_pair
using namespace std;
const int infi=1e9;
const LL infl=1e18;
const ldb eps=1e-9;

struct Seg_Tree
{
	int n;
	vector<pii> tr;
	vector<set<pli,greater<pli>>> st;
	Seg_Tree() {n=0;}
	Seg_Tree(int N)
	{
		n=N;
		tr.resize(n*4+10,mp(-infi,0));
		st.resize(n);
	}
	#define mid ((l+r)>>1)
	void insert(int x,int l,int r,int p,pii v)
	{
		if(l==r)
		{
			st[l].insert(v);
			tr[x]=*st[l].begin();
			return ;
		}
		if(p<=mid) insert(x<<1,l,mid,p,v);
		else insert(x<<1|1,mid+1,r,p,v);
		tr[x]=max(tr[x<<1],tr[x<<1|1]);
	}
	void erase(int x,int l,int r,int p,pii v)
	{
		if(l==r)
		{
			st[l].erase(v);
			if(st[l].empty()) tr[x]=mp(-infi,0);
			else tr[x]=*st[l].begin();
			return ;
		}
		if(p<=mid) erase(x<<1,l,mid,p,v);
		else erase(x<<1|1,mid+1,r,p,v);
		tr[x]=max(tr[x<<1],tr[x<<1|1]);
	}
	pii query(int x,int l,int r,int p)
	{
		if(p<=l) return tr[x];
		pii res=query(x<<1|1,mid+1,r,p);
		if(p<=mid) res=max(res,query(x<<1,l,mid,p));
		return res;
	}
	#undef mid 
	void ins(int p,int v,int i) {insert(1,0,n-1,p,mp(v,i));}
	void del(int p,int v,int i) {erase(1,0,n-1,p,mp(v,i));}
	pii qry(int p) {return query(1,0,n-1,p);}
};
typedef tuple<LL,int,int> tup;
int n;
void solve()
{
	cin>>n;vector<int> a(n+1,0),b(n+1,0),c(n+1,0);
	for(int i=1;i<=n;++i) cin>>a[i]>>b[i]>>c[i];
	vector<int> ans(n+1,0);
	LL l=0,r=infl,res=infl;
	auto check=[&](LL v)
	{
		vector<LL> val,w(n+1,0);
		LL s=0;set<tup> st;
		for(int i=1;i<=n;++i)
		{
			w[i]=v/c[i]-a[i];
			s+=b[i];
			if(b[i]-a[i]>=0) val.pb(w[i]);
			else st.insert({w[i]+a[i]-b[i],a[i]-b[i],i});
		}
//		cout<<"ok\n";
		sort(val.begin(),val.end());val.erase(unique(val.begin(),val.end()),val.end());
		Seg_Tree T(val.size());
		int m=0;
		for(int i=1;i<=n;++i)
			if(b[i]-a[i]>=0)
			{
				++m;
				T.ins(w[i]=lower_bound(val.begin(),val.end(),w[i])-val.begin(),b[i]-a[i],i);
			}
		for(int i=1;i<=m;++i)
		{
			int p=lower_bound(val.begin(),val.end(),s)-val.begin();
			auto [W,P]=T.qry(p);
			if(!P) return 0;
			ans[i]=P;s-=W;T.del(w[P],W,P);
		}
		for(auto [W,V,P]:st)
		{
			if(s>w[P]) return 0;
			s+=V;ans[++m]=P;
		}
		return 1;
	};
	while(l<=r)
	{
		LL mid=(l+r)>>1;
		if(check(mid)) res=mid,r=mid-1;
		else l=mid+1;
	}
//	cout<<res<<'\n';
	check(res);
	for(int i=1;i<=n;++i) cout<<ans[i]<<' ';
	cout<<'\n';
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int TT=1;
	cin>>TT;
	for(;TT;--TT) solve();
	return 0;
}
/*
2
4
1 1 4
5 1 5
1 9 1
9 8 1
9
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
3 2 3
8 4 6
2 6 8
3 2 7

*/