#include<bits/stdc++.h>
using namespace std;
#define N 100010
vector<int> g[N];
int n,m,k;
bool ok[N];
mt19937 rnd;
void work(){
	scanf("%d%d%d",&n,&m,&k);
	for(int i=1;i<=n;i++)g[i].clear();
	for(int i=1;i<=k;i++){
		int u,v;scanf("%d%d",&u,&v);g[u].push_back(v);
	}
	for(int i=1;i<=n;i++){
		sort(g[i].begin(),g[i].end());g[i].erase(unique(g[i].begin(),g[i].end()),g[i].end());
	}
	while(1){
		int ans=0;
		for(int i=1;i<=m;i++)ok[i]=rnd()&1,ans+=ok[i];
		int a0=0,a1=0;
		for(int u=1;u<=n;u++){
			bool z=0;
			for(int v:g[u])z^=ok[v];
			if(z)a1++;
			else a0++;
		}
		if((a1+ans)*2>=(n+m)){
			vector<int> vv;
			for(int u=1;u<=n;u++){
				bool z=0;
				for(int v:g[u])z^=ok[v];
				if(z)vv.push_back(u);
			}
			printf("%d %d\n",a1,ans);
			for(int x:vv)printf("%d ",x);
			printf("\n");
			for(int i=1;i<=m;i++)if(ok[i])printf("%d ",i);
			printf("\n");
			break;
		}
	}	
}
int main(){
	int t;scanf("%d",&t);
	while(t--)work();
}