#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using pl = pair<ll, ll>;

void solve() {
    ll n;
    cin >> n;
    ll sum = 0;
    vector<array<ll, 3>> a(n);
    for (auto &v: a) {
        for (auto &i: v) {
            cin >> i;
        }
        sum += v[0];
    }
    auto eval = [&](const vector<ll> &p) {
        ll res = 0;
        ll sa = 0, sb = 0;
        for (auto &v: a)sa += v[0];
        for (auto i: views::reverse(p)) {
            sb += a[i][1];
            res = max(res, (sa + sb) * a[i][2]);
            sa -= a[i][0];
        }
        return res;
    };
    ll l = 0, r = 1e18 + 123;
    vector<ll> ans;
    while (r - l > 1) {
        ll m = (r + l) / 2;
        priority_queue<array<ll, 3>, vector<array<ll, 3>>, greater<>> invalid, valid;
        ll cur = 0;
        vector<ll> z;
        for (int i = 0; i < n; ++i) {
            auto &v = a[i];
            ll val = m / v[2] - sum - v[0];
            invalid.push({v[1] - v[0] - val, v[1] - v[0], i});
        }
        while (invalid.size() + valid.size()) {
            while (invalid.size() && invalid.top()[0] + cur <= 0) {
                auto it = invalid.top();
                invalid.pop();
                valid.push({it[1], it[0], it[2]});
            }
            if (valid.empty())break;
            auto it = valid.top();
            if (it[1] + cur > 0) {
                invalid.push({});
                break;
            }
            if (it[0] > 0) {
                break;
            }
            valid.pop();
            cur += it[0];
            z.push_back(it[2]);
        }
        if (invalid.size()) {
            l = m;
            continue;
        }
        vector<ll> o;
        {
            priority_queue<array<ll, 3>, vector<array<ll, 3>>, greater<>> i, v;
            vector<array<ll, 3>> zxc;
            while (valid.size())zxc.push_back(valid.top()), valid.pop();
            for (auto &[x, y, z]: zxc) {
                cur += x;
                i.push({y - x, x, z});
            }
            while (i.size() + v.size()) {
                while (i.size() && i.top()[0] + cur <= 0) {
                    auto it = i.top();
                    i.pop();
                    v.push({it[1], it[0], it[2]});
                }
                if (v.empty())break;
                auto it = v.top();
                if (it[1] + cur > 0) {
                    break;
                }
                v.pop();
                cur -= it[0];
                o.push_back(it[2]);
            }
            if (i.size() + v.size()) {
                l = m;
                continue;
            }
        }
        r = m;
        reverse(o.begin(), o.end());
        copy(o.begin(), o.end(), back_inserter(z));
        ans = z;
    }
//    cout << r << "\n";
    reverse(ans.begin(),ans.end());
    for (auto x: ans) {
        cout << x + 1 << " ";
    }
    cout << "\n";
}

int main() {
    cin.tie(0)->sync_with_stdio(false);
    ll t;
    cin >> t;
    while (t--)solve();
}