#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std ;

const int N = 1e5+10;
long long sumb;
int n;

struct Node{
    int a, b, c, id;
    long long minus, con;
}a[N];

bool cmp(Node a, Node b){
    if(a.minus <= 0 && b.minus <= 0)
        return a.con > b.con;
    if(a.minus <= 0 || b.minus <= 0)
        return a.minus < b.minus;
    return a.con + a.minus < b.con + b.minus; 
}

bool judge(long long x){ //O(nlogn)
    for(int i = 1 ; i <= n ; ++i){
        a[i].con = sumb - a[i].a + x / a[i].c;
    }
    
    sort(a + 1, a+n+1, cmp);
    
    long long summi = 0, maxx = 0;
    
    for(int i = 1 ; i <= n ; ++i){
        summi += a[i].minus;
        long long temp = 1LL * a[i].c * (sumb + summi + a[i].b);
        maxx = temp > maxx ? temp : maxx;
    } 
    return maxx <= x;
}

void solve(){ 
    sumb = 0;
    scanf("%d",&n);
    for(int i = 1 ; i <= n ; ++i){
        scanf("%d%d%d",&a[i].a, &a[i].b, &a[i].c);
        a[i].id = i;
        
        sumb += a[i].b ;
        a[i].minus = a[i].a - a[i].b;
    }
    
    
    long long l = 0, r = 1e18;
    while (l + 1 < r) {
        long long mid = l + ((r - l) >> 1 );
        if (judge(mid)) 
            r = mid;
        else
            l = mid;
    }
    judge(r);
    for(int i = 1 ; i <= n ; ++i){
        printf("%d ", a[i].id);
    }
    printf("\n");
}

int main(){
    int T;
    scanf("%d", &T);
    while(T--){
        solve();
    }
    return 0;
}