#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

struct seg {
    int l, r, id;
} p[N];

int cmp1(seg x, seg y) {
    return x.r < y.r;
}

int vis[N];

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        for (int i = 1; i <= n; ++i) scanf("%d%d", &p[i].l, &p[i].r), p[i].id = i, vis[i] = 0;
        sort(p + 1, p + n + 1, cmp1);
        vector<int> id1;
        for (int i = 1, mx = 0; i <= n; ++i) {
            if (p[i].l > mx) id1.push_back(i), mx = p[i].r;
        }
        vector<int> p1, p2, p3, p4;
        for (int i = 0; i < (int)id1.size(); ++i) {
            if (i < id1.size() >> 1) p1.push_back(id1[i]);
            else p2.push_back(id1[i]);
        }
        for (auto x : p1) vis[x] = 1;
        for (auto x : p2) vis[x] = 1;
        for (int i = 1; i <= n; ++i) if (!vis[i]) {
            int flg = 0;
            for (auto x : p1) {
                flg |= (p[i].l <= p[x].r && p[x].l <= p[i].r);
                if (flg) break;
            }
            if (flg) p3.push_back(i);
            else p4.push_back(i);
        }
        p1.insert(p1.end(), p3.begin(), p3.end());
        p2.insert(p2.end(), p4.begin(), p4.end());
        if (p1.size() < p2.size()) swap(p1, p2);
        for (int i = 0; i < (n >> 1); ++i) printf("%d%c", p[p1[i]].id, " \n"[i + 1 == (n >> 1)]);
    }
    return 0;
}