#include <bits/stdc++.h>
#define int long long
using namespace std;
vector <int> res,tmp,tmp2;
vector <pair <int, int>> ve,ve2;
int t,n,a[100001],b[100001],c[100001],sumb;
pair <int, int> st[400001];
void build(int node, int l, int r){
    if (l==r){
        int i=ve[l].second;
        st[node]={a[i]-b[i],l};
        return;
    }
    int mid=(l+r)>>1;
    build(node<<1,l,mid);
    build(node<<1|1,mid+1,r);
    st[node]=min(st[node<<1],st[node<<1|1]);
}
void update(int node, int l, int r, int i){
    if (l>i||r<i)
        return;
    if (l==r){
        st[node].first=1e9;
        return;
    }
    int mid=(l+r)>>1;
    update(node<<1,l,mid,i);
    update(node<<1|1,mid+1,r,i);
    st[node]=min(st[node<<1],st[node<<1|1]);
}
pair <int, int> get(int node, int l, int r, int u, int v){
    if (l>v||r<u||l>r)
        return {1e9,0};
    if (l>=u&&r<=v)
        return st[node];
    int mid=(l+r)>>1;
    return min(get(node<<1,l,mid,u,v),get(node<<1|1,mid+1,r,u,v));
}
bool check(int x){
    tmp.clear();
    tmp2.clear();
    ve.clear();
    ve2.clear();
    for (int i=1;i<=n;i++){
        int lim=x/c[i]-sumb-a[i];
        if (a[i]<=b[i])
            ve.push_back({lim,i});
        else
            ve2.push_back({lim+a[i]-b[i],i});
    }
    sort(ve.begin(),ve.end());
    sort(ve2.begin(),ve2.end());
    int cur=0;
    if (!ve.empty()){
        build(1,0,ve.size()-1);
        while (true){
            int i=lower_bound(ve.begin(),ve.end(),make_pair(cur,-1LL))-ve.begin();
            auto [x,y]=get(1,0,ve.size()-1,i,ve.size()-1);
            if (x>1e6)
                break;
            update(1,0,ve.size()-1,y);
            y=ve[y].second;
            cur+=a[y]-b[y];
            tmp.push_back(y);
        }
        if (tmp.size()<ve.size())
            return false;
    }
    for (auto [i,j]:ve2)
        cur+=a[j]-b[j];
    swap(ve,ve2);
    if (!ve.empty()){
        build(1,0,ve.size()-1);
        while (true){
            int i=lower_bound(ve.begin(),ve.end(),make_pair(cur,-1LL))-ve.begin();
            auto [x,y]=get(1,0,ve.size()-1,i,ve.size()-1);
            if (x>1e6)
                break;
            update(1,0,ve.size()-1,y);
            y=ve[y].second;
            cur+=b[y]-a[y];
            tmp2.push_back(y);
        }
        if (tmp2.size()<ve.size())
            return false;
    }
    res.clear();
    for (int i:tmp)
        res.push_back(i);
    reverse(tmp2.begin(),tmp2.end());
    for (int i:tmp2)
        res.push_back(i);
    return true;
}
void solve(){
    cin >> n;
    sumb=0;
    for (int i=1;i<=n;i++){
        cin >> a[i] >> b[i] >> c[i];
        sumb+=b[i];
    }
    int l=0,r=1e18,kq=-1;
    res.clear();
    while (l<=r){
        int mid=(l+r)>>1;
        if (check(mid)){
            kq=mid;
            r=mid-1;
        }
        else
            l=mid+1;
    }
    for (int i:res)
        cout << i << ' ';
    cout << '\n';
}
int32_t main(){
    ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
    cin >> t;
    while (t--)
        solve();
}