#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<unordered_map>
#include<vector>
#include<bitset>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<random>
#include<numeric>
#include<assert.h>
using namespace std;
#define int long long
#define ll long long
#define ull unsigned long long
#define lc (x<<1)
#define rc (x<<1|1)
#define pii pair<int,int>
#define mkp make_pair
#define fi first
#define se second
const int Mx=500005,p=998244353;
int read(){
	char ch=getchar();
	int Alice=0,Aya=1;
	while(ch<'0'||ch>'9'){
		if(ch=='-') Aya=-Aya;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
		Alice=(Alice<<3)+(Alice<<1)+(ch^48),ch=getchar();
	return (Aya==1?Alice:-Alice);
}
int n;
struct Seg{
	int l,r,id;
	bool operator <(const Seg&obj)const{
		return r<obj.r;
	}
}a[Mx];
bool Inter(int L,int R,int l,int r){
	if(l<L) swap(L,l),swap(R,r);
	if(l<=R) return 1;
	else return 0;
}
int Check(vector<int>res){
	int maxR=0,ans=0;
	//cout<<"-------------\n";
	for(int id:res){
		//cout<<a[id].l<<" "<<a[id].r<<" : "<<a[id].id;
		if(a[id].l>maxR) maxR=a[id].r,ans++;//,cout<<"*";
		//cout<<endl;
	}
	return ans;
}
mt19937 rd(time(0));
uniform_int_distribution<int>dist(1,100000000);
void Solve(){
	n=read();
	for(int i=1;i<=n;i++){
		a[i].l=read(),a[i].r=read(),a[i].id=i;
	}
	sort(a+1,a+n+1);
	int maxR=0,ans=0;
	vector<int>chos;
	for(int i=1;i<=n;i++){
		//cout<<a[i].l<<' '<<a[i].r<<endl;
		if(a[i].l>maxR) maxR=a[i].r,ans++,chos.push_back(i);
	}
	//cout<<ans<<endl;
	ans>>=1;
	//cout<<ans<<endl;
	for(int i=0;i+ans-1<(int)chos.size();i++){
		int L=a[chos[i]].l,R=a[chos[i+ans-1]].r,cnt=0;
		for(int j=chos[i];j<=n;j++){
			int l=a[j].l,r=a[j].r;
			if(Inter(L,R,l,r)) cnt++;
		}
		if(cnt<n/2) continue;
		//cout<<L<<" - "<<R<<endl;
		vector<int>res,Res;
		res.push_back(a[chos[i]].id);
		Res.push_back(chos[i]);
		if(ans!=1) res.push_back(a[chos[i+ans-1]].id),Res.push_back(chos[i+ans-1]);
		for(int j=chos[i];j<=n;j++){
			if(j==chos[i]||j==chos[i+ans-1]) continue;
			int l=a[j].l,r=a[j].r;
			if(Inter(L,R,l,r)&&(int)res.size()*2<n){
				res.push_back(a[j].id);
				Res.push_back(j);
			}
		}
		sort(Res.begin(),Res.end());
		if(Check(Res)!=ans){
//			cout<<Check(Res)<<endl;
//			while(1);
			continue;
		}
		for(int id:res) printf("%lld ",id);
		puts("");
		return;
	}
	while(1);
}
signed main(){
	int T=read();
	while(T--) Solve();
	return 0;
}
/*
Hello!!
Sample:
1
10
1 4
2 12
9 16
6 16
13 16
2 16
1 18
14 18
5 19
5 19
-------------------
*/