#include<iostream>
#include<cstdio>
#include<map>
#include<queue>
#include<algorithm>
#define N 300000
#define M 3000000
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct points
{
	int r,c,num;
	bool operator < (const points &t)const
	{
		return r!=t.r?r<t.r:c<t.c;	
	}
};
points st[N+1],st2[N+1];
struct reads
{
	int l,r;
	bool operator < (const reads &t)const
    {
		return l!=t.l?l<t.l:r<t.r;
	}
};
int T,n,m,k,s,t,len=1,length,length2,head[N+1],cur[N+1],dque[N+1],top,pst[N+1],depth[N+1],pv1[N+1],pv2[N+1],A[N+1],B[N+1];
bool used[N+1],vis[N+1];
map<int,int>P;
map<reads,int>num;
map<reads,int>num2;
bool cmp(points a,points b)
{
	return a.c!=b.c?a.c<b.c:a.r<b.r;
}
struct node
{
	int v,data,num,nxt;
};
node edge[M+1];
void add(int x,int y,int z,int w)
{
	edge[++len]=(node){y,z,0,head[x]},head[x]=len;
	edge[++len]=(node){x,0,w,head[y]},head[y]=len;
	return;
}
bool bfs()
{
	int top;
	queue<int>q;
	for (int i=s;i<=t;++i) depth[i]=0;
	q.push(s),depth[s]=1;
	while (!q.empty())
	{
		top=q.front(),q.pop();
		for (int i=head[top];i>0;i=edge[i].nxt)
			if (edge[i].data&&!depth[edge[i].v])
				depth[edge[i].v]=depth[top]+1,q.push(edge[i].v);
	}
	return depth[t]>0;
}
int dinic(int x,int flow)
{
	if (x==t) return flow;
	int k;
	for (int &i=cur[x];i>0;i=edge[i].nxt)
		if (edge[i].data&&depth[edge[i].v]==depth[x]+1)
		{
			k=dinic(edge[i].v,min(flow,edge[i].data));
			if (k)
			{
				edge[i].data-=k,edge[i^1].data+=k;
				return k;
			}
		}
	return 0;
}
int main()
{
	int ps,cnt,flow,res;
	T=read();
	while (T--)
	{
		n=read(),m=read(),k=m-read(),length=length2=res=top=ps=0,len=1,P.clear(),num.clear(),num2.clear();
		for (int i=1;i<=n;++i) st[i].r=read(),st[i].c=read(),st[i].num=i;
		for (int i=1;i<=m;++i) st2[i].r=read(),st2[i].c=read(),st2[i].num=i,vis[i]=A[i]=B[i]=0;
		sort(st+1,st+n+1),sort(st2+1,st2+m+1);
		for (int i=1;i<=n;++i)
		{
			if (P.find(st[i].c)!=P.end()) num[(reads){P[st[i].c],st[i].num}]=++length;
			P[st[i].c]=st[i].num;
		}
		P.clear();
		for (int i=1;i<=n;++i)
		{
			if (P.find(st[i].r)!=P.end()) num2[(reads){P[st[i].r],st[i].num}]=++length2;
			P[st[i].r]=st[i].num;
		}
		P.clear();
		for (int i=1;i<=m;++i)
		{
			while (ps+1<=n&&st[ps+1].r<=st2[i].r) ++ps,P[st[ps].c]=st[ps].num;
			pv1[st2[i].num]=P[st2[i].c];
		}
		ps=n+1,P.clear();
		for (int i=m;i>=1;--i)
		{
			while (ps-1>=1&&st[ps-1].r>=st2[i].r) --ps,P[st[ps].c]=st[ps].num;
			pv2[st2[i].num]=P[st2[i].c];
		}
		for (int i=1;i<=m;++i)
			if (pv1[i]&&pv2[i])
				A[i]=num[(reads){pv1[i],pv2[i]}];
		sort(st+1,st+n+1,cmp),sort(st2+1,st2+m+1,cmp),ps=0,P.clear();
		for (int i=1;i<=m;++i)
		{
			while (ps+1<=n&&st[ps+1].c<=st2[i].c) ++ps,P[st[ps].r]=st[ps].num;
			pv1[st2[i].num]=P[st2[i].r];
		}
		ps=n+1,P.clear();
		for (int i=m;i>=1;--i)
		{
			while (ps-1>=1&&st[ps-1].c>=st2[i].c) --ps,P[st[ps].r]=st[ps].num;
			pv2[st2[i].num]=P[st2[i].r];
		}
		for (int i=1;i<=m;++i)
			if (pv1[i]&&pv2[i])
				B[i]=num2[(reads){pv1[i],pv2[i]}];
		s=0,t=length+length2+1;
		for (int i=1;i<=length;++i) add(s,i,1,0);
		for (int i=1;i<=length2;++i) add(length+i,t,1,0);
		for (int i=1;i<=m;++i)
			if (A[i]&&B[i])
				add(A[i],length+B[i],1,i);
		while (bfs())
		{
			for (int i=s;i<=t;++i) cur[i]=head[i];
			while (flow=dinic(s,inf)) res+=flow;
		}
		for (int i=1;i<=len;++i)
			if (edge[i].num&&edge[i].data)
				dque[++top]=edge[i].num;
		if (k<=top)
		{
			printf("%d\n",length+length2-(k<<1));
			for (int i=1;i<=k;++i) vis[dque[i]]=1;
		}
		else
		{
			cnt=top<<1;
			for (int i=1;i<=length+length2;++i) used[i]=pst[i]=0;
			for (int i=1;i<=m;++i)
			{
				if (A[i]) pst[A[i]]=i;
				if (B[i]) pst[length+B[i]]=i;
			}
			for (int i=1;i<=top;++i) used[A[dque[i]]]=used[length+B[dque[i]]]=1;
			for (int i=1;i<=length+length2;++i)
				if (!used[i]&&pst[i]&&top+1<=k)
					cnt++,dque[++top]=pst[i];
			for (int i=1;i<=top;++i) vis[dque[i]]=1;
			for (int i=1;i<=m;++i)
				if (!vis[i]&&top+1<=k)
					vis[i]=1,++top;
			printf("%d\n",length+length2-cnt);
		}
		for (int i=1;i<=m;++i)
			if (!vis[i])
				printf("%d ",i);
		puts("");
		for (int i=s;i<=t;++i) head[i]=0;
	}
	return 0;
}