#include<bits/stdc++.h>
using namespace std;
#define N 500005
int n,m,m1,vis[N],vis1[N],b[N],c[N];
int ql[N],qr[N],cl[N];
struct node{int l,r,x;}a[N];
bool operator<(node a,node b){
	if(a.r==b.r)return a.l>b.l;
	return a.r<b.r;
}
bool cmp(node a,node b){
	if(a.l==b.l)return a.r<b.r;
	return a.l>b.l;
}
void solve(){
	cin>>n,m=m1=0;
	for(int i=1;i<=n;++i){
		vis[i]=vis1[i]=0;
		cin>>a[i].l>>a[i].r,a[i].x=i;
		ql[i]=a[i].l,qr[i]=a[i].r;
	}
	sort(a+1,a+n+1);
	int tr=0;
	for(int i=1;i<=n;++i){
		if(a[i].l<=tr)continue;
		tr=a[i].r,vis[a[i].x]=1,b[++m]=a[i].x;
	}
	int tl=1e9;++tl;
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;++i){
		if(a[i].r>=tl)continue;
		tl=a[i].l,vis1[a[i].x]=1,c[++m1]=a[i].x;
	}
	int c1=0,c2=0,ct=n/2;
	for(int i=1;i<=n;++i){
		if(qr[i]<ql[c[m/2]])++c2;
		if(ql[i]>qr[b[m/2]])++c1;
		cl[i]=1;
	}
	if(c1<=n/2){
		for(int i=1;i<=n;++i)if(ql[i]>qr[b[m/2]])--ct,cl[i]=0;
		for(int i=1;i<=n;++i){
			if(!cl[i])continue;
			if(vis[i])continue;
			if(ct)--ct,cl[i]=0;
		}
		for(int i=1;i<=n;++i)if(cl[i])cout<<i<<" ";cout<<endl;
	}
	for(int i=1;i<=n;++i)if(qr[i]>ql[c[m/2]])--ct,cl[i]=0;
	for(int i=1;i<=n;++i){
		if(!cl[i])continue;
		if(vis1[i])continue;
		if(ct)--ct,cl[i]=0;
	}
	for(int i=1;i<=n;++i)if(cl[i])cout<<i<<" ";cout<<endl;
}
int main(){
	ios::sync_with_stdio(0); 
	int T;cin>>T;
	while(T--)solve();
	return 0;
}