#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1e5 + 5;
ll n, sum, a[N], b[N], c[N], d[N], e[N];
int p[N], ans[N];
bool check(ll mid){
    _rep(i, 1, n) p[i] = i, d[i] = a[i] - b[i], e[i] = mid / c[i] - sum - a[i];
    sort(p + 1, p + 1 + n, [](int x, int y){
        if((d[x] <= 0) != (d[y] <= 0)) return d[x] < d[y];
        if(d[x] <= 0 && d[y] <= 0) return e[x] > e[y];
        return e[x] + d[x] < e[y] + d[y];
    });
    bool ok = 1; ll cur = 0;
    _rep(i, 1, n){
        ok &= (sum + cur + a[i]) * c[i] <= mid;
        cur += d[p[i]];
    }
    if(ok) _rep(i, 1, n) ans[i] = p[i];
    return ok;
}
void work(){
    ll maxn = 0;
    _rep(i, 1, n) read(p[i]);
    _rep(i, 1, n){
        ll cur = 0;
        _rep(j, 1, i) cur += a[p[j]];
        _rep(j, i, n) cur += b[p[j]];
        cur = cur * c[p[i]];
        maxn = max(maxn, cur);
    }
    writeln(maxn);
}
int main(){
    multitest(){
        read(n);
        _rep(i, 1, n) read(a[i], b[i], c[i]), sum += b[i];
        ll l = 1, r = 1e18, res = 0;
        while(l <= r){
            ll mid = l + r >> 1ll;
            if(check(mid)) res = mid, r = mid - 1;
            else l = mid + 1;
        }
        // debug("res:%lld\n", res);
        check(res);
        _rep(i, 1, n) writes(ans[i]); puts("");
        // work(), work();
        _rep(i, 1, n) a[i] = b[i] = c[i] = d[i] = e[i] = ans[i] = 0;
        sum = 0;
    }
    return 0;
}