#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pr;
const int mod=998244353,inf=1e9,N=2e5;
struct E{
	int to,val;
};
ll dis[N+5];
int L[N+5],R[N+5],inq[N+5],len[N+5],n,m,b[N+5];
vector<E> g[N+5];
/*bool Isanc(int y,int x){
	if(len[y]>len[x])return 0;
	for(int i=17;i>=0;i--)if(p[x][i]&&len[p[x][i]]>=len[y])x=p[x][i];
	if(x==y)return 1;
	return 0;
}*/
bool SPFA(int v){
	deque<int> q;
	for(int i=1;i<=m;i++){
		dis[i]=inq[i]=len[i]=0,q.push_back(i),inq[i]=1;
		g[i].clear();
	}
	for(int i=2;i<=m;i++)g[i].push_back({i-1,0});
	for(int i=1;i<=n;i++){
		g[R[i]].push_back({L[i],-1});
		g[L[i]].push_back({R[i],v});
	}
	while(!q.empty()){
		int x=q.front();
		q.pop_front(),inq[x]=0;
		for(E i:g[x]){
			int y=i.to;
			if(dis[y]>dis[x]+i.val){
				//if(Isanc(y,x))return 0;
				dis[y]=dis[x]+i.val;
				len[y]=len[x]+1;
				//for(int j=1;j<=17;j++)p[y][j]=p[p[y][j-1]][j-1];
				if(!inq[y]){
					if(q.size()&&dis[y]<dis[q.front()])q.push_front(y);
					else q.push_back(y);
					inq[y]=1;
				}
				if(len[y]>=m)return 0;
			}
		}
	}
	return 1;
}
void Solve(){
	scanf("%d",&n),m=0;
	for(int i=1;i<=n;i++)scanf("%d%d",&L[i],&R[i]),L[i]--,b[++m]=L[i],b[++m]=R[i];
	sort(b+1,b+m+1),m=unique(b+1,b+m+1)-b-1;
	for(int i=1;i<=n;i++){
		L[i]=lower_bound(b+1,b+m+1,L[i])-b;
		R[i]=lower_bound(b+1,b+m+1,R[i])-b;
	}
	int l=1,r=n,ans=-1;
	while(l<=r){
		int mid=(l+r)/2;
		if(SPFA(mid))ans=mid,r=mid-1;
		else l=mid+1;
	}
	cout<<ans<<' ',SPFA(ans);
	vector<int> out;
	for(int i=1;i<=m;i++)if(dis[i]>dis[i-1])out.push_back(b[i]);
	cout<<out.size()<<' ';
	for(int i:out)cout<<i<<' ';
	puts("");
}
int main(){
	int t;
	cin>>t;
	while(t--)Solve();
}