#include <bits/stdc++.h>
using namespace std;
const int N=2510,M=2510*10; 
class Maxflow{
private:
	int nedge=1,p[2*M],nex[2*M],head[N],c[2*M],cur[2*M];
    int dist[2*N];
    int S,T;
	void Addedge(int a,int b,int v){
		p[++nedge]=b;nex[nedge]=head[a];head[a]=nedge;
		c[nedge]=v;
	}
    bool bfs(){
		queue<int>q;
		for(int i=S;i<=T;i++)dist[i]=-1;
		dist[S]=0;q.push(S);
		while(!q.empty()){
			int now=q.front();q.pop();
			for(int k=head[now];k;k=nex[k])if(dist[p[k]]==-1&&c[k]>0){
				dist[p[k]]=dist[now]+1;
				q.push(p[k]);
			}
		}
		return dist[T]>-1;
	}
	int dfs(int x,int low){
		if(x==T)return low;
		if(low==0)return 0;
		int used=0;
		for(int &k=cur[x];k;k=nex[k])if(dist[p[k]]==dist[x]+1&&c[k]>0){
			int a=dfs(p[k],min(c[k],low-used));
			c[k]-=a;c[k^1]+=a;used+=a;
			if(low==used)break;
		}
		if(used==0)dist[x]=-1;
		return used;
	}
public:
	void init(int s,int t){
		for(int i=S;i<=T;i++)head[i]=0;
		S=s,T=t;
		nedge=1;
	}
    void addedge(int a,int b,int v){
        // cout<<"addedge a="<<a<<" b="<<b<<" v="<<v<<endl;
        Addedge(a,b,v);
        Addedge(b,a,0);
	}
	vector<pair<int,int>> dinic(){
		int flow=0;
		while(bfs()){
			for(int i=S;i<=T;i++)cur[i]=head[i];
			flow+=dfs(S,1e9);
		}
        vector<pair<int,int>> v;
        for(int i=S+1;i<T;i++){
			for(int k=head[i];k;k=nex[k])if(c[k]==0&&(k%2==0)){
                v.emplace_back(i,p[k]);
            }
        }
        return v;
	}
}sol;
struct point{
    int x,y,id,type;
};
void solve()
{
    int n,m,k;cin>>n>>m>>k;
    k=m-k;
    vector<point> a;
    for(int i=0;i<n;i++){
        int x,y;cin>>x>>y;
        a.push_back(point{x,y,i,0});
    }
    for(int i=0;i<m;i++){
        int x,y;cin>>x>>y;
        a.push_back(point{x,y,i,1});
    }
    vector<vector<point>>p; 
    vector<vector<int>> link(m);
    sort(a.begin(),a.end(),[&](point x,point y){
        return make_pair(x.x,x.y)<make_pair(y.x,y.y);
    });
    for(int i=0;i<n+m;i++)if(a[i].type==0){
        vector<point> v;
        for(int j=i+1;j<n+m;j++){
            if(a[j].x!=a[i].x)break;
            if(a[j].type==1)v.push_back(a[j]);
            else{
                for(auto it:v)link[it.id].push_back((int)p.size());
                p.push_back(v);
                break;
            }
        }
    }
    sort(a.begin(),a.end(),[&](point x,point y){
        return make_pair(x.y,x.x)<make_pair(y.y,y.x);
    });
    for(int i=0;i<n+m;i++)if(a[i].type==0){
        vector<point> v;
        for(int j=i+1;j<n+m;j++){
            if(a[j].y!=a[i].y)break;
            if(a[j].type==1)v.push_back(a[j]);
            else{
                for(auto it:v)link[it.id].push_back((int)p.size());
                p.push_back(v);
                break;
            }
        }
    }
    int s=0,t=(int)p.size()+1;
    sol.init(s,t);
    vector<int> vis(p.size());
    map<pair<int,int>,int> edge_id;
    for(int i=0;i<m;i++){
        assert((int)link[i].size()<=2);
        if(link[i].size()==2){
            sol.addedge(link[i][0]+1,link[i][1]+1,1);
            edge_id[{link[i][0],link[i][1]}]=i;
            if(!vis[link[i][0]])vis[link[i][0]]=1,sol.addedge(s,link[i][0]+1,1);
            if(!vis[link[i][1]])vis[link[i][1]]=1,sol.addedge(link[i][1]+1,t,1);
        }
    }
    // cout<<"p="<<p.size()<<" edge="<<edge_id.size()<<endl;
    auto match=sol.dinic();
    int all=p.size();
    vector<int>ok(p.size());
    vector<int>ans;
    vector<int>in(m);
    for(auto [x,y]:match)if(k>0){
        k--;
        x--,y--;
        ok[x]=1,ok[y]=1;
        all-=2;
        in[edge_id[{x,y}]]=1;
    }
    for(int i=0;i<p.size();i++)if(!ok[i]&&k>0&&!p[i].empty()){
        k--;
        all--;
        ok[i]=1;
        in[p[i][0].id]=1;
    }
    for(int i=0;i<m;i++)if(!in[i]&&k>0){
        k--;
        in[i]=1;
    }
    cout<<all<<"\n";
    for(int i=0;i<m;i++)if(!in[i])ans.push_back(i+1);
    for(auto it:ans)cout<<it<<" ";;cout<<"\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;cin>>T;while(T--)solve();
    return 0;
}