#include<bits/stdc++.h>
using namespace std;

#define ar(x) array<int,x>
#define pb push_back
#define U(x) ((int)x.size())
const int N=1e5+100,INF=1e9;
#define gc getchar()
#define rd read()
inline int read(){
	int x=0,f=0; char c=gc;
	for(;c<'0'||c>'9';c=gc) f|=(c=='-');
	for(;c>='0'&&c<='9';c=gc) x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

int n,m,k,s,t,ans=0,to[N],ls[4*N],l_c=0; ar(2) a[N],b[N];
inline int get(int x){ return lower_bound(ls+1,ls+l_c+1,x)-ls; }
set<ar(2)> px[4*N],py[4*N]; vector<int> vc;

inline int findx(int x,int y){
	auto it=px[x].upper_bound({y,0});
	if(it==px[x].end()||it==px[x].begin()||(*it)[1]==-1||(*prev(it))[1]==-1) return 0;
	return (*prev(it))[1];
}
inline int findy(int x,int y){
	auto it=py[y].upper_bound({x,0});
	if(it==py[y].end()||it==py[y].begin()||(*it)[1]==-1||(*prev(it))[1]==-1) return 0;
	return (*prev(it))[1];
}

int head[N*2],cur[N*2],ne[N*6],v[N*6],fl[N*6],tot=1;
void add(int x,int y,int f){
	ne[++tot]=head[x],head[x]=tot,v[tot]=y,fl[tot]=f;
	ne[++tot]=head[y],head[y]=tot,v[tot]=x,fl[tot]=0;	
}

queue<int> q; int dis[N*2];
int bfs(){
	for(int i=1;i<=t;++i) cur[i]=head[i],dis[i]=0;
	q.push(s),dis[s]=1;
	while(!q.empty()){
		int u=q.front(); q.pop();
		for(int i=head[u];i;i=ne[i]) if(!dis[v[i]]&&fl[i]) dis[v[i]]=dis[u]+1,q.push(v[i]);
	}
	return dis[t]!=0;
}
int dinic(int u,int df){
	if(u==t) return df;
	int res=df;
	for(int i=cur[u];res&&i;i=ne[i]){
		cur[u]=i;
		if(dis[v[i]]==dis[u]+1&&fl[i]){
			int k=dinic(v[i],min(res,fl[i]));
			if(!k) dis[v[i]]=0;
			else res-=k,fl[i]-=k,fl[i^1]+=k;
		}
	}
	return df-res;
}

void solve(){
	n=rd,m=rd,k=m-rd,ans=0,s=2*n+1,t=2*n+2;
	for(int i=1;i<=n;++i) a[i]={ls[++l_c]=rd,ls[++l_c]=rd};
	for(int i=1;i<=m;++i) b[i]={ls[++l_c]=rd,ls[++l_c]=rd};
	sort(ls+1,ls+l_c+1),l_c=unique(ls+1,ls+l_c+1)-ls-1;
	for(int i=1;i<=n;++i) a[i][0]=get(a[i][0]),a[i][1]=get(a[i][1]);
	for(int i=1;i<=m;++i) b[i][0]=get(b[i][0]),b[i][1]=get(b[i][1]);
	
	for(int i=1;i<=n;++i) px[a[i][0]].insert({a[i][1],i}),py[a[i][1]].insert({a[i][0],i});
	for(int i=1;i<=l_c;++i) ans+=max(0,U(px[i])-1),ans+=max(0,U(py[i])-1);
	for(int i=1,l,r;i<=m;++i){
		auto [x,y]=b[i]; l=findx(x,y),r=findy(x,y);
		if(l&&r) to[i]=tot+1,add(l,r+n,1);
	} 
	for(int i=1;i<=n;++i) add(s,i,1);
	for(int i=1;i<=n;++i) add(i+n,t,1);
	
	while(bfs()) while(dinic(s,INF));
	
	for(int i=1;k&&i<=m;++i){
		if(!to[i]||fl[to[i]]) to[i]=0;
		else ans-=2,--k,vc.pb(i),px[b[i][0]].insert({b[i][1],-1}),py[b[i][1]].insert({b[i][0],-1});
	}
	for(int i=1;k&&i<=m;++i){
		if(to[i]||(!findx(b[i][0],b[i][1])&&!findy(b[i][0],b[i][1]))) continue;
		--ans,--k,vc.pb(i),to[i]=1,px[b[i][0]].insert({b[i][1],-1}),py[b[i][1]].insert({b[i][0],-1});
	}
	for(int i=1;k&&i<=m;++i) if(!to[i]) vc.pb(i),to[i]=1,--k;
	
	printf("%d\n", ans);
	for(int i=1;i<=m;++i) to[i]=0; for(int v:vc) to[v]=1; vc={};
	for(int i=1;i<=m;++i) if(!to[i]) printf("%d ", i); puts("");
	
	for(int i=1;i<=m;++i) to[i]=0;
	for(int i=1;i<=t;++i) head[i]=0; tot=1;
	for(int i=1;i<=l_c;++i) px[i].clear(),py[i].clear(); l_c=0;
}

int main(){
	
	int T=rd;
	while(T--) solve();

	return 0;
}