#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> 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 SPFA(int v){
	deque<int> q;
	for(int i=m;i;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(const E& i:g[x]){
			int y=i.to;
			if(dis[y]>dis[x]+i.val){
				dis[y]=dis[x]+i.val;
				len[y]=len[x]+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;
}
int is[N+5];
pr seg[N+5];
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;
		seg[i]=pr(R[i],L[i]);
	}
	sort(seg+1,seg+n+1);
	for(int i=1,cur=-1;i<=n;i++){
		if(cur>seg[i].second);
		else cur=seg[i].first,is[cur]++;
	}
	for(int i=1;i<=m;i++)is[i]+=is[i-1];
	int ans=0;
	for(int i=1;i<=n;i++)ans=max(ans,is[R[i]]-is[L[i]]);
	if(ans>1&&SPFA(ans-1))ans--;
	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("");
	for(int i=1;i<=m;i++)is[i]=0;
}
int main(){
	int t;
	cin>>t;
	while(t--)Solve();
}