#include <bits/stdc++.h>

#define rep(i, s, n) for (int i = int(s); i < int(n); i++)
#define rrep(i, s, n) for (int i = int(n) - 1; i >= int(s); i--)
#define all(v) (v).begin(), (v).end()

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128_t;

template <class T> bool chmin(T &a, T b) {
    if (a <= b) return false;
    a = b;
    return true;
}

template <class T> bool chmax(T &a, T b) {
    if (a >= b) return false;
    a = b;
    return true;
}

void solve() {
    int n;
    std::cin >> n;
    std::vector<ll> a(n), b(n), c(n);
    ll sum_a = 0;
    std::vector<int> neg, pos, zero;
    rep(i, 0, n) {
        std::cin >> a[i] >> b[i] >> c[i];
        sum_a += a[i];
        if (b[i] - a[i] < 0) {
            neg.emplace_back(i);
        } else if (b[i] - a[i] == 0) {
            zero.emplace_back(i);
        } else {
            pos.emplace_back(i);
        }
    }
    auto check = [&](ll x) -> std::vector<int> {
        std::vector<int> p;
        ll sum = 0;
        std::sort(all(neg), [&](int i, int j) -> bool {
            ll lhs = x - (sum_a * c[i] + b[i] * c[i]);
            ll rhs = x - (sum_a * c[j] + b[j] * c[j]);
            return i128(lhs) * c[j] > i128(rhs) * c[i];
        });
        for (auto i : neg) {
            if (sum * c[i] + sum_a * c[i] + b[i] * c[i] > x) {
                return {};
            }
            sum += b[i] - a[i];
            p.emplace_back(i);
        }
        for (auto i : zero) {
            if (sum * c[i] + sum_a * c[i] + b[i] * c[i] > x) {
                return {};
            }
            sum += b[i] - a[i];
            p.emplace_back(i);
        }
        using P = std::pair<ll, int>;
        std::priority_queue<P> pq;
        std::queue<int> que;
        std::sort(all(pos), [&](int i, int j) -> bool {
            ll lhs = x - (sum_a * c[i] + b[i] * c[i]);
            ll rhs = x - (sum_a * c[j] + b[j] * c[j]);
            return i128(lhs) * c[j] > i128(rhs) * c[i];
        });
        for (auto i : pos) {
            sum += b[i] - a[i];
        }
        for(auto i: pos) {
            sum -= b[i] - a[i];
            assert(sum * c[i] + sum_a * c[i] + b[i] * c[i] <= x);
        }
        if(!pq.empty()) {
            return {};
        }
        std::reverse(all(p));
        auto ans = pos;
        ans.insert(ans.end(), all(p));
        return ans;
    };
    ll ok = 2'000'000'000'000'000'000;
    ll ng = 0;
    while ((ok - ng) > 1) {
        ll mid = (ok + ng) >> 1;
        auto ret = check(mid);
        if (ret.empty()) {
            ng = mid;
        } else {
            ok = mid;
        }
    }
    auto ans = check(ok);
    rep(i, 0, n) {
        std::cout << ans[i] + 1 << " \n"[i == n - 1];
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    int t;
    std::cin >> t;
    while (t--) {
        solve();
    }
}