#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
	int T;
	cin>>T;
	while(T--)
	{
		int n;
		cin>>n;
		struct thing
		{
			ll a,b,c,del,bound;
			int id;
			bool operator<(const thing &t)const{return a-b>t.a-t.b;}
		};
		vector<thing> a(n+5);
		ll sumb=0;
		for(int i=1;i<=n;i++)
		{
			cin>>a[i].a>>a[i].b>>a[i].c;
			sumb+=a[i].b;
			a[i].id=i;
		}
		for(int i=1;i<=n;i++)
		{
			a[i].del=(a[i].a+sumb)*a[i].c;
		}
		auto downdiv=[&](ll x,ll y)
		{
			ll r=(x%y+y)%y;
			return (x-r)/y;
		};
		vector<int> ans;
		auto chk=[&](ll lim)
		{
//			cerr<<"chk "<<lim<<endl;
			ans.clear();
			// (a+sumb)*c + (sum{<} (a-b) )*c <= lim
			// (sum{<}(a-b))*c<=lim-del;
			// sum <= bound
			vector<thing> neg,pos;
			for(int i=1;i<=n;i++)
			{
				//calc bound
				a[i].bound=downdiv((lim-a[i].del),a[i].c);
				if(a[i].a-a[i].b>0)
				{
					a[i].bound+=a[i].a-a[i].b;
					pos.push_back(a[i]);
				}
				else
				{
					neg.push_back(a[i]);
				}
//				cerr<<i<<' '<<a[i].a<<' '<<a[i].b<<' '<<a[i].c<<' '<<a[i].del<<' '<<a[i].bound<<endl;
			}
			sort(neg.begin(),neg.end(),[&](const thing &x,const thing &y)
			{
				return x.bound>y.bound;
			});
			sort(pos.begin(),pos.end(),[&](const thing &x,const thing &y)
			{
				return x.bound<y.bound;
			});
			priority_queue<thing> pq;
			ll sum=0;
			int idx=0;
//			cerr<<sum<<' '<<idx<<' '<<(idx<neg.size()?neg[idx].bound:-1)<<endl;
			while(idx<(int)neg.size() and neg[idx].bound>=sum)
			{
				pq.push(neg[idx]),idx++;
			}
			while(not pq.empty())
			{
				thing u=pq.top();pq.pop();
				ans.push_back(u.id);
				sum+=u.a-u.b;
				while(idx<(int)neg.size() and neg[idx].bound>=sum)
				{
					pq.push(neg[idx]),idx++;
				}
			}
			if(idx<(int)neg.size())
			{
//				cerr<<"boom neg "<<neg[idx].id<<endl;
				return false;
			}
			for(auto u:pos)
			{
				ans.push_back(u.id);
				sum+=u.a-u.b;
				if(sum>u.bound)
				{
//					cerr<<"boom pos "<<u.id<<endl;
					return false;
				}
			}
			return true;
		};
		ll l=0,r=1e18;
		while(l<r)
		{
			ll mid=(l+r)/2;
			if(chk(mid))r=mid;
			else l=mid+1;
		}
		chk(l);
//		cerr<<l<<"\n";
		for(auto x:ans)
			cout<<x<<' ';
		cout<<"\n";
	}
	
	return 0;
}