#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+5;
int n,a[N],b[N],c[N],B;
int d[N],e[N];

int p[N];
bool cmp(int x,int y) {
    if(d[x]<0&&d[y]<0) return e[x]>e[y];
    if(d[x]<0) return 1;
    if(d[y]<0) return 0;
    if(d[x]+e[x]!=d[y]+e[y]) return d[x]+e[x]<d[y]+e[y];
    return e[x]<e[y];
}
bool check(int t) {
    for(int i=1;i<=n;i++) {
        p[i]=i;
        d[i]=a[i]-b[i];
        e[i]=t/c[i]-a[i]-B;
    }
    sort(p+1,p+n+1,cmp);
    int sum=0;
    for(int i=1;i<=n;i++) {
        int x=p[i];
        if(sum>e[x]) return false;
        sum+=d[x];
    }
    return true;
}
signed main() {
    int T;scanf("ll%d",&T);
    while(T--) {
        scanf("%lld",&n);B=0;
        for(int i=1;i<=n;i++) scanf("%lld%lld%lld",&a[i],&b[i],&c[i]),B+=b[i];
        int l=0,r=1e9,ans,mid;
        while(l<=r) {
            mid=(l+r)>>1;
            if(check(mid)) {
                ans=mid;
                l=mid+1;
            }
            else r=mid-1;
        }
        check(ans);
        for(int i=1;i<=n;i++) printf("%lld ",p[i]);puts("");
    }
    return 0;
}