#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<int> a(n), b(n), c(n);
        ll sum = 0, best = 0, mx = 0;
        for (int i = 0; i < n; i++) {
            cin >> a[i] >> b[i] >> c[i];
            sum += min(a[i], b[i]);
        }
        for (int i = 0; i < n; i++) {
            ll aqui = (sum + max(a[i], b[i])) * c[i];
            if (aqui > mx) {
                mx = aqui;
                best = i;
            }
        }
        vector<int> before, after;
        for (int i = 0; i < n; i++) {
            if (i == best) continue;
            if (a[i] < b[i]) before.push_back(i + 1);
            else after.push_back(i + 1);
        }

        for (int x : before) cout << x << ' ';
        cout << best + 1 << ' ';
        for (int x : after) cout << x << ' ';
        cout << '\n';
    }    
    return 0;
}