#include <bits/stdc++.h>
#define int long long

using namespace std;

const int N = 1e5 + 10;
const double eps = 1e-10;
int n;
int a[N], b[N], c[N];
int sb;

struct Node {
    int a, c, id;
}p[N];

bool check(int k) {
    int tot = 0;
    for (int i = 1; i <= n; ++i) {
        if (a[i] - b[i] < 0) {
            p[++tot] = (Node){a[i] - b[i], k / c[i] - (b[i] + sb), i};
        }
    }
    int mid = tot;
    for (int i = 1; i <= n; ++i) {
        if (a[i] - b[i] >= 0) {
            p[++tot] = (Node){a[i] - b[i], k / c[i] - (b[i] + sb), i};
        }
    }
    sort(p + 1, p + mid + 1, [](Node a, Node b) -> bool{
        return a.c > b.c;
    });
    sort(p + mid + 1, p + tot + 1, [](Node a, Node b) -> bool {
        return a.c < b.c;
    });
    int s = 0;
    for (int i = 1; i <= n; ++i) {
        s += (p[i].a);
        if (s - p[i].c > eps) {
            return 0;
        }
    }
    return 1;
}

void solve() {
    scanf("%lld", &n);
    for (int i = 1; i <= n; ++i) {
        scanf("%lld%lld%lld", &a[i], &b[i], &c[i]);
        sb += b[i];
    }
    int l = 0, r = 2e18 + 1e17;
    while (l < r) {
        int mid = (l + r) >> 1;
        if (check(mid)) r = mid;
        else l = mid + 1;
    }
    check(l);
    for (int i = 1; i <= n; ++i) {
        printf("%lld ", p[i].id);
    }
    printf("\n");
    // printf("%d\n", l);
}

signed main() {
    int T;
    scanf("%lld", &T);
    while (T--) {
        solve();
    }
    return 0;
}