#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int MOD = 1e9 + 7;
const int MAXN = 5e5 + 5;
const ll INF = 2e18;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        vector<ll> a(n), b(n), c(n);
        for (int i = 0; i < n; i++) {
            cin >> a[i] >> b[i] >> c[i];
        }
        vector<int> before, after, equal;
        for (int i = 0; i < n; i++) {
            if (a[i] < b[i]) before.push_back(i);
            else if (a[i] > b[i]) after.push_back(i);
            else equal.push_back(i);
        }
        sort(before.begin(), before.end(), [&] (int i, int j) {
            return max((a[i] + a[j] + b[j]) * c[j], (a[i] + b[i] + b[j]) * c[i]) 
                 < max((a[j] + a[i] + b[i]) * c[i], (a[j] + b[j] + b[i]) * c[j]);
        });
        sort(after.begin(), after.end(), [&] (int i, int j) {
            return max((a[i] + a[j] + b[j]) * c[j], (a[i] + b[i] + b[j]) * c[i]) 
                 < max((a[j] + a[i] + b[i]) * c[i], (a[j] + b[j] + b[i]) * c[j]);
        });
        for (int x : before) cout << x + 1 << ' ';
        for (int x : equal) cout << x + 1 << ' ';
        for (int x : after) cout << x + 1 << ' ';
        cout << '\n';
    }    
    return 0;
}