#include <iostream>
#include <algorithm>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1e5 + 10;

int n, a[MAXN], b[MAXN], c[MAXN];
ll sum;

struct Data
{
    ll d, x; int id;
    bool operator < (const Data u) const
    {
        if (d <= 0 && u.d > 0) return 1;
        if (d > 0 && u.d <= 0) return 0;
        if (d <= 0 && u.d <= 0) return x - d > u.x - u.d;
        return x < u.x;
    }
}f[MAXN];

inline bool Check(ll mid)
{
    for (int i = 1; i <= n; i++) f[i].d = b[i] - a[i], f[i].x = mid / c[i] - sum, f[i].id = i;
    sort(f + 1, f + n + 1);
    ll psum = 0;
    for (int i = 1; i <= n; i++)
    {
        psum += f[i].d;
        if (psum > f[i].x) return 0; 
    }
    return 1;
}

int main()
{
    #if DEBUG
    #else
    ios::sync_with_stdio(0), cin.tie(0);
    #endif
    int T;
    Read(T);
    while (T--)
    {
        Read(n);
        sum = 0;
        for (int i = 1; i <= n; i++) Read(a[i]), Read(b[i]), Read(c[i]), sum += a[i];
        ll l = 0, r = 1e17, mid, ans;
        while (l <= r)
        {
            mid = l + r >> 1ll;
            if (Check(mid)) ans = mid, r = mid - 1;
            else l = mid + 1;
        }
        Check(ans);
        for (int i = n; i >= 1; i--) cout << f[i].id << " ";
        cout << "\n";
    }
    return 0;
}