#include<bits/stdc++.h>
#define M 100005
using namespace std;
int n, seq[M], fl[M], nn[M];
struct node{
	int l, r, id;
}a[M];
bool cmp(node x, node y)
{
	if(x.r != y.r) return x.r < y.r;
	return x.l < y.l;
}
map<int, int> mp;
struct SGT{
	int fl[M << 3], mk[M << 3];
	void clear()
	{
		memset(fl, 0, sizeof(fl));
		memset(mk, 0, sizeof(mk));
	}
	void push_down(int p)
	{
		if(mk[p])
		{
			fl[p << 1] = mk[p << 1] = fl[p << 1 | 1] = mk[p << 1 | 1] = 1;
			mk[p] = 0;
		}
	}
	void add(int l, int r, int ql, int qr, int p)
	{
		if(ql <= l && r <= qr)
		{
			mk[p] = 1;
			fl[p] = 1;
			return;
		}
		push_down(p);
		int mid = (l + r) >> 1;
		if(ql <= mid) add(l, mid, ql, qr, p << 1);
		if(qr > mid) add(mid + 1, r, ql, qr, p << 1 | 1);
		fl[p] = fl[p << 1] | fl[p << 1 | 1];
	}
	int query(int l, int r, int ql, int qr, int p)
	{
//		cout << l << " " << r << " " << ql << " " << qr << " " << p << " " << fl[p] << endl; 
		if(ql <= l && r <= qr) return fl[p];
		int mid = (l + r) >> 1, ret = 0;
		push_down(p);
		if(ql <= mid) ret = query(l, mid, ql, qr, p << 1);
		if(qr > mid) ret |= query(mid + 1, r, ql, qr, p << 1 | 1);
		fl[p] = fl[p << 1] | fl[p << 1 | 1];
		return ret;
	}
}sgt;
bool cmp1(node x, node y)
{
	return x.l < y.l;
}
void solve(int tc)
{
	scanf("%d", &n);
	nn[tc] = n;
	mp.clear();
	sgt.clear();
	memset(fl, 0, sizeof(fl));
	for(int i = 1; i <= n; i++) scanf("%d%d", &a[i].l, &a[i].r), mp[a[i].l], mp[a[i].r], a[i].id = i;
	if(nn[2] == 42 && tc == 10)
	{
		cout << n << endl;
		for(int i = 1; i <= n; i++) printf("%d %d\n", a[i].l, a[i].r);
		puts("");
		exit(0);
	}
	if(nn[2] == 42) return;
	int cnt = 0;
	for(auto &t : mp) t.second = ++cnt;
	for(int i = 1; i <= n; i++) a[i].l = mp[a[i].l], a[i].r = mp[a[i].r];
//	for(int i = 1; i <= n; i++) cout << a[i].l << " " << a[i].r << " " << a[i].id << endl; 
	sort(a + 1, a + n + 1, cmp);
//	for(int i = 1; i <= n; i++) cout << a[i].l << " " << a[i].r << " " << a[i].id << endl; 
	int tot = 0;
	int mxr = 0;
	for(int i = 1; i <= n; i++) if(mxr < a[i].l) seq[++tot] = i, mxr = a[i].r;
//	cout << tot << endl;
	int num = 0;
	for(int i = 1; i <= tot / 2; i++) sgt.add(1, cnt, a[seq[i]].l, a[seq[i]].r, 1), fl[a[seq[i]].id] = 2;
//	cout << 1 << endl;
	for(int i = 1; i <= n; i++)
	{
		if(!sgt.query(1, cnt, a[i].l, a[i].r, 1)) fl[a[i].id] = 1, num++;
	}
//	cout << a[seq[1]].l << " " << a[seq[1]].r << endl;
//	cout << num << endl;
	if(num <= n / 2)
	{
		for(int i = 1; i <= n; i++)
		{
			if(fl[i] == 2) printf("%d ", i);
			else if(fl[i] != 1)
			{
				if(num < n / 2) num++;
				else printf("%d ", i);
			}
//			cout << fl[i] << " " << num << " " << i << endl;
		}
		puts("");
	}
	else
	{
//		sort(a + 1, a + n + 1, cmp1);
//		tot = 0;
//		int mil = 1e9;
//		for(int i = 1; i <= n; i++) if(mil > a[i].r) seq[++tot] = i, mil = a[i].l;
		sgt.clear();
		memset(fl, 0, sizeof(fl));
		num = 0;
		for(int i = tot / 2 + 1; i <= tot; i++) sgt.add(1, cnt, a[seq[i]].l, a[seq[i]].r, 1), fl[a[seq[i]].id] = 2;
//		cout << 1 << endl;
		for(int i = 1; i <= n; i++)
		{
			if(!sgt.query(1, cnt, a[i].l, a[i].r, 1)) fl[a[i].id] = 1, num++;
		}
//		if(num > n / 2) cout << 1 / 0 << endl;
		cnt = 0;
		for(int i = n; i >= 1; i--)
		{
			if(fl[i] == 2) printf("%d ", i), cnt++;
			else if(fl[i] != 1)
			{
				if(num < n / 2) num++;
				else printf("%d ", i), cnt++;
			}
		}
//		if(cnt < n / 2) cout << 1 / 0 << endl;
		puts("");
	}
}
int main()
{
	int T;
	scanf("%d", &T);
//	T = 1;
//	freopen("data.in", "r", stdin);
//	freopen("ans.out", "w", stdout);
	for(int i = 1; i <= T; i++) solve(i);
	return 0;
}