#include<bits/stdc++.h>
using namespace std;
#define All(x) \
x.begin(),x.end()
using vi=vector<int>;
const int N=1e5+5;
int n,l[N],r[N],id[N];
bool cmp1(int x,int y)
{return (r[x]==r[y])?
(l[x]>l[y]):(r[x]<r[y]);}
bool cmp2(int x,int y)
{return (l[x]==l[y])?
(r[x]<r[y]):(l[x]>l[y]);}
int mj[N],m;bool tg[N];
void solve()
{
    cin>>n;m=0;iota(id+1,id+n+1,1);
    for(int i=1;i<=n;i++)tg[i]=0;
    for(int i=1;i<=n;i++)cin>>l[i]>>r[i];
    sort(id+1,id+n+1,cmp1);int cr=-1;
    /*cout<<"===\n";
    for(int i=1;i<=n;i++)
    {
        cout<<l[id[i]]<<' '<<r[id[i]]<<'\n';
    }*/
    for(int i=1;i<=n;i++)
    if(l[id[i]]>cr)tg[i]=1,
    cr=r[id[i]],mj[++m]=i;
    vi vL,vR;for(int i=1;i<=n;i++)if(!tg[i])
    {
        if(i<=mj[m/2])vL.push_back(i);
        else vR.push_back(i);
    }if(vL.size()>vR.size())
    {
        while(vL.size()+m/2>n/2)
        vL.pop_back();
        for(int i=1;i<m/2;i++)cout<<id[mj[i]]<<' ';
        for(int c:vL)cout<<id[c]<<' ';cout<<'\n';
    }else
    {
        while(vR.size()+m/2>n/2)
        vR.pop_back();
        for(int i=m/2+1;i<=m;i++)cout<<id[mj[i]]<<' ';
        for(int c:vR)cout<<id[c]<<' ';cout<<'\n';
    }
}
int main()
{
    //ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t;cin>>t;while(t--)solve();return 0;
}