#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
struct A {
    long long a, b, c;
    int flag;
    int num;
} a[N];
int n;
long long tot = 0;
bool ss(A t1, A t2) {
    if (t1.flag != t2.flag)
        return t1.flag < t2.flag;
    if (t1.flag) {
        return t1.c * (t2.a - t2.b) > t2.c * (t1.a - t1.b);
    } else
        return t1.c * (t2.b - t2.a) < t2.c * (t1.b - t1.a);
}

int main() {
    int T;
    cin >> T;
    while (T--) {
        tot = 0;
        cin >> n;
        for (int i = 1; i <= n; i++) {
            cin >> a[i].a >> a[i].b >> a[i].c;
            if (a[i].a > a[i].b) {
                a[i].flag = 1;
            } else
                a[i].flag = 0;
            a[i].num = i;
            tot += min(a[i].a, a[i].b);
        }
        sort(a + 1, a + n + 1, ss);
        for (int i = 1; i <= n; i++)
            if (i != n)
                cout << a[i].num << ' ';
            else
                cout << a[i].num;
        cout << '\n';
    }
    return 0;
}