/*
after dusk passed,
there is a starry sky.
*/
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define m_k make_pair
#define len(a) (int)a.size()
using namespace std;
const int N=2*1e5+100;
int TT,n,l[N],r[N],b[N],w,nxt[N][21],ok[N];
inline void ckmin(int &a,int b){a=((a<b)?a:b);}
inline void ckmax(int &a,int b){a=((a>b)?a:b);}
inline int read()
{
	int f=1,x=0;char s=getchar();
	while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
	while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}
	return x*f;
}
struct node
{
	int l,r;
}sh[N];
struct bit//前缀和
{
	int sh[N],n;
	inline void init(int m){n=m;memset(sh,0,(n+10)*sizeof(int));}
	int lowbit(int x){return x&(-x);}
	void change(int x,int v){while(x<=n)sh[x]+=v,x+=lowbit(x);}
	int query(int x){int ans=0;while(x)ans+=sh[x],x-=lowbit(x);return ans;}
}T;
vector <int> p[N];
int pre[N];
bool check(int t)
{
	for (int i=1;i<=w;i++) p[i].clear();
	for (int i=1;i<=n;i++) p[sh[i].l].push_back(sh[i].r);
	set <int> s;int MIN=inf;
	pre[0]=0;
	for (int i=1;i<=w;i++)
	{
		pre[i]=pre[i-1];
		for (int j:p[i]) ckmax(pre[i],j);
	}
	for (int i=0;i<=20;i++) nxt[w+1][i]=w+1;
	for (int i=w;i>=0;i--)
	{
		if (MIN==inf)
		{
			ok[i]=1;s.insert(i);
			for (int j=0;j<=20;j++) nxt[i][j]=w+1;
			for (int j:p[i]) ckmin(MIN,j);
			continue;
		}
		auto it=s.upper_bound(MIN);
		if (it==s.begin()) ok[i]=0;
		else
		{
			nxt[i][0]=*prev(it);
			int MAX=0;
			for (int j:p[i]) ckmin(MIN,j);
			for (int j=1;j<=20;j++) nxt[i][j]=nxt[nxt[i][j-1]][j-1];
			int x=i;
			for (int j=20;j>=0;j--) if (t>>j&1) x=nxt[x][j];
			if (!x||pre[i]<x) ok[i]=1,s.insert(i);
			else ok[i]=0;
		}
	}
	return ok[0];
}
signed main()
{
	TT=read();
	while (TT--)
	{
		n=read();w=0;
		for (int i=1;i<=n;i++)
		{
			sh[i]=(node){read(),read()};
			b[++w]=sh[i].l,b[++w]=sh[i].r;
		}
		sort(b+1,b+1+w);w=unique(b+1,b+1+w)-b-1;
		for (int i=1;i<=n;i++)
		{
			sh[i].l=lower_bound(b+1,b+1+w,sh[i].l)-b;
			sh[i].r=lower_bound(b+1,b+1+w,sh[i].r)-b;
		}
		T.init(w);
		sort(sh+1,sh+1+n,[](node a,node b){return a.r<b.r||(a.r==b.r&&a.l>b.l);});
		int cnt=1;vector <int> ans;
		for (int i=1;i<=n;i++)
		{
			int now=T.query(sh[i].r)-T.query(sh[i].l-1);
			if (now){ckmax(cnt,now);continue;}
			T.change(sh[i].r,1);ans.push_back(b[sh[i].r]);
		}
		if (cnt==1||!check(cnt-1))
		{
			printf("%d %d ",cnt,len(ans));
			for (int i:ans) printf("%d ",i);
			printf("\n");
			continue;
		}
		ans.clear();
		for (int x=nxt[0][0];x!=w+1;x=nxt[x][0]) ans.push_back(b[x]);
		printf("%d %d ",cnt-1,len(ans));
		for (int i:ans) printf("%d ",i);
		printf("\n");
	}
}