#include<bits/stdc++.h>
using namespace std;
 
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
using ll = long long;
const int N = 1e5 + 5;
ll a[N], b[N], c[N];
int ab[N], ba[N];
int S1, S2, n;
int ans[N];
ll bound[N];
ll B = 0;
bool check(ll cost){
    ll ah = 0, bh = 0;
    for(int i = 0; i < n; i++){
        bound[i] = cost / c[i] - B - a[i];
    }
    sort(ab, ab + S1, [&](int x, int y){
        return bound[x] > bound[y];
    });
    int c = 0;
    for(int i = 0; i < S1; i++){
        if(ah - bh <= bound[ab[i]]){
            ah += a[ab[i]];
            bh += b[ab[i]];
            ans[c++] = ab[i] + 1;
        }else{
            return false;
        }
    }
    sort(ba, ba + S2, [&](int x, int y){
        return bound[x] + a[x] - b[x] < bound[y] + a[y] - b[y];
    });
    for(int i = 0; i < S2; i++){
        if(ah - bh <= bound[ba[i]]){
            ah += a[ba[i]];
            bh += b[ba[i]];
            ans[c++] = ba[i] + 1;
        }else{
            return false;
        }
    }
    return true;
}   

void solve() {
    cin >> n;

    S1 = S2 = 0;

    for(int i =0; i < n; i++){
        cin >> a[i] >> b[i] >> c[i];
        if(a[i] - b[i] >= 0)
            ab[S1++] = i;
        else
            ba[S2++] = i;
        B += b[i];
    }

    ll l = -1, r = 1e18;
    while(r - l > 1){
        ll mid = (l + r) >> 1;
        if(check(mid))
            r = mid;
        else
            l = mid;
    }
    check(r);
    for(int i = 0; i < n; i++){
        cout << ans[i] << ' ';
    }
    cout << '\n';
}
 
int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);
    int t = 1;
    cin >> t;
    while(t--)
        solve();
    return 0;
}