#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define Mp make_pair
#define SZ(x) (int((x).size()))

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

void solve() {
    int n;
    cin >> n;

    vector<array<int, 4>> ve(n);
    for(int i = 0; i < n; i++) {
        cin >> ve[i][0] >> ve[i][1] >> ve[i][2];
        ve[i][3] = i;
    }
    sort(ve.begin(), ve.end(), [&](array<int, 4> &a, array<int, 4> &b) {
        if(a[2] != b[2]) return a[2] > b[2];
        int fla = a[0] < a[1], flb = b[0] < b[1];
        if(fla != flb) return fla > flb;
        if(fla) {
            return (a[1] - a[0]) < (b[1] - b[0]);
        } else {
            return (a[0] - a[1]) < (b[0] - b[1]);
        }
    });
    
    deque<int> q;
    for(auto [a, b, c, id] : ve) {
        if(a < b) q.push_front(id);
        else q.push_back(id);
    }
    for(auto x : q) cout << x + 1 << " ";
    cout << "\n";
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}