#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;

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

    vector<array<ll, 5>> ve(n);
    ll a = 0, b = 0;
    for(int i = 0; i < n; i++) {
        cin >> ve[i][0] >> ve[i][1] >> ve[i][2];
        if(ve[i][0] < ve[i][1]) a += ve[i][0];
        else b += ve[i][1];
        ve[i][3] = i;
    }
    
    for(int i = 0; i < n; i++) {
        ve[i][4] = (a + b + max(ve[i][0], ve[i][1])) * ve[i][2];
    }

    vi ans; ll val = LLONG_MAX;
    for(int _ = 0; _ < 100; _++) {
        sort(ve.begin(), ve.end(), [&](auto a, auto b) {
            auto [a1, b1, c1, id1, d1] = a;
            auto [a2, b2, c2, id2, d2] = b;
            ll ij = max(d1 + c1 * max(0ll, b2 - a2), d2 + c2 * max(0ll, a1 - b1));
            ll ji = max(d1 + c1 * max(0ll, a2 - b2), d2 + c2 * max(0ll, b1 - a1));
            return ij < ji;
        });
        vector<ll> prea(n), sufb(n);
        prea[0] = ve[0][0];
        for(int i = 1; i < n; i++) prea[i] = prea[i - 1] + ve[i][0];
        sufb[n - 1] = ve[n - 1][1];
        for(int i = n - 2; i >= 0; i--) sufb[i] = sufb[i + 1] + ve[i][1];
        ll now = 0;
        for(int i = 0; i < n; i++) {
            now = max(now, ve[i][2] * (prea[i] + sufb[i]));
        }
        if(now < val) {
            ans.clear();
            for(auto i : ve) ans.pb(i[3]);
        }
    }
    
    for(auto i : ans) cout << i + 1 << ' ';
    cout << '\n';
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> t;
    for(int i = 0; i < t; i++) solve(i + 1);
    return 0;
}
/*
2
4
1 1 4
5 1 5
1 9 1
9 8 1
9
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
3 2 3
8 4 6
2 6 8
3 2 7

*/