#include<bits/stdc++.h>
using namespace std;
namespace mf{
constexpr int N=200010,M=1000010;
int head[N],cur[N],d[N],nex[M],cap[M],ver[M],n,s,t,tot=1;
queue<int>q;
inline void add(int u,int v,int c){
   nex[++tot]=head[u],cap[tot]=c,ver[tot]=v,head[u]=tot;
   nex[++tot]=head[v],cap[tot]=0,ver[tot]=u,head[v]=tot;
}
bool bfs(){
   for(int i=1;i<=n;i++)d[i]=-1,cur[i]=head[i];
   q.push(s),d[s]=0;
   for(;!q.empty();){
      int u=q.front();q.pop();
      for(int e=head[u];e;e=nex[e]){
         int v=ver[e],c=cap[e];
         if(c&&d[v]==-1){
            d[v]=d[u]+1,q.push(v);
         }
      }
   }return d[t]!=-1;
}
int dinic(int u,int flow){
   if(u==t)return flow;
   int rest=flow;
   for(int e=cur[u];e&&rest;e=nex[e]){
      cur[u]=e;
      int v=ver[e],c=cap[e];
      if(c&&d[u]+1==d[v]){
         int f=dinic(v,min(rest,c));
         if(!f)d[v]=-1;
         cap[e]-=f,cap[e^1]+=f,rest-=f;
      }
   }return flow-rest;
}
set<pair<int,int>>calc(){
   for(;bfs();dinic(s,1e9));
   set<pair<int,int>>mtc;
   for(int e=head[s];e;e=nex[e])if(!cap[e]){
      int u=ver[e],v;
      for(int o=head[u];o;o=nex[o])if(!cap[o])v=ver[o];
      mtc.emplace(u,v);
   }
   return mtc;
}
void clear(){
   for(int i=1;i<=n;i++)head[i]=0;
}
}
int n,m,k,cutR[100010],cutC[100010];
void solve(){
   cin>>n>>m>>k;
   int cnt=0;
   map<int,vector<int>>rows,cols;
   map<pair<int,int>,int>idrow,idcol;
   for(int i=1,x,y;i<=n;i++){
      scanf("%d%d",&x,&y);
      rows[x].push_back(y);
      cols[y].push_back(x);
   }
   for(auto&X:rows){
      sort(begin(X.second),end(X.second));
      cnt+=X.second.size()-1;
   }
   for(auto&X:cols){
      sort(begin(X.second),end(X.second));
      cnt+=X.second.size()-1;
   }
   map<int,int>raw;
   mf::s=++mf::n,mf::t=++mf::n;
   for(int i=1,x,y;i<=m;i++){
      scanf("%d%d",&x,&y);
      cutR[i]=cutC[i]=0;
      if(rows.count(x)){
         auto&X=rows[x];
         if(X[0]<y&&y<X.back()){
            int&u=idrow[{x,*upper_bound(begin(X),end(X),y)}];
            if(!u)u=++mf::n,mf::add(mf::s,u,1);
            cutR[i]=u;
         }
      }
      if(cols.count(y)){
         auto&X=cols[y];
         if(X[0]<x&&x<X.back()){
            int&u=idcol[{y,*upper_bound(begin(X),end(X),x)}];
            if(!u)u=++mf::n,mf::add(u,mf::t,1);
            cutC[i]=u;
         }
      }
      if(cutR[i]&&cutC[i])mf::add(cutR[i],cutC[i],1);
   }
   auto mtc=mf::calc();
   set<int>mtcR,mtcC;
   for(auto X:mtc)mtcR.insert(X.first),mtcC.insert(X.second);
   vector<int>ans[3],vis(m+1);
   for(int i=1;i<=m;i++)if(mtc.count({cutR[i],cutC[i]}))ans[0].push_back(i),vis[i]=1;
   for(int i=1;i<=m;i++)if(!vis[i]){
      if(cutR[i]&&mtcR.insert(cutR[i]).second)ans[1].push_back(i),vis[i]=1;
      else if(cutC[i]&&mtcC.insert(cutC[i]).second)ans[1].push_back(i),vis[i]=1;
   }
   for(int i=1;i<=m;i++)if(!vis[i])ans[2].push_back(i);
   vector<int>realans;
   k=m-k;
   for(int u:ans[0]){
      if(!k)realans.push_back(u);
      else cnt-=2,k--;
   }
   for(int u:ans[1]){
      if(!k)realans.push_back(u);
      else cnt--,k--;
   }
   for(int u:ans[2]){
      if(!k)realans.push_back(u);
      else k--;
   }
   printf("%d\n",cnt);
   for(int u:realans)printf("%d ",u);puts("");
   mf::clear();
}
int main(){
   int T;for(cin>>T;T--;)solve();
   return 0;
}