#include <bits/stdc++.h>
#define int long long 
#define pb push_back
using namespace std;
const int INF=1e6+5;
int n,m,k,a[INF],b[INF],p[INF],p2[INF];
int c[INF],d[INF],vis5[INF],vis3[INF],vis4[INF];
vector <int> cnt2[INF];
namespace flow{
    struct _node_edge{
        int to_,next_,disv_,id;
    }edge[INF<<1];
    int tot,totn,head[INF],S,T,dep[INF];
    queue <int> q;
    void add_edge(int x,int y,int z,int zz) {
        edge[++tot]={y,head[x],z,zz};
        head[x]=tot;

        swap(x,y);z=0;
        edge[++tot]={y,head[x],z,0};
        head[x]=tot;
    }
    int BFS(int s) {
        for (int p=0;p<=totn;p++) dep[p]=0;
        dep[s]=1;q.push(s);
        while (q.size()) {
            int x=q.front();q.pop();
            for (int i=head[x];i;i=edge[i].next_) {
                int v=edge[i].to_;
                if (!edge[i].disv_) continue;
                if (dep[v]) continue;
                dep[v]=dep[x]+1;
                q.push(v);
            }
        }
        return dep[T]!=0;
    }
    int DFS(int x,int li) {
        if (x==T) return li;
        if (!li) return 0;
        int sum=0;
        for (int i=head[x];i;i=edge[i].next_) {
            int v=edge[i].to_,d=edge[i].disv_;
            if (!d) continue;
            if (!li) break;
            if (dep[v]!=dep[x]+1) continue;
            int xx=DFS(v,min(li,d));
            if (!xx) {dep[v]=1e9;continue;}
            edge[i].disv_-=xx;edge[i^1].disv_+=xx;
            sum+=xx;li-=xx;
        }
        return sum;
    }
    void main() {
        while (BFS(S)) DFS(S,m-k);
        for (int x=1;x<=totn;x++) {
            for (int i=head[x];i;i=edge[i].next_) {
                if (!edge[i].id) continue;
                if (!edge[i].disv_) vis5[edge[i].id]=1,vis3[x]=1,vis4[edge[i].to_]=1;
            }
        }
    }
};
void solve() {
    for (int w=0;w<=flow::totn;w++) flow::head[w]=vis3[w]=vis4[w]=0;
    cin>>n>>m>>k; flow::tot=1;flow::totn=0;
    for (int i=1;i<=n;i++) cin>>a[i]>>b[i],vis5[i]=0;
    for (int i=1;i<=m;i++) cin>>c[i]>>d[i];
    for (int i=1;i<=m;i++) cnt2[i].clear();
    for (int i=1;i<=n;i++) p[i]=i;
    for (int i=1;i<=m;i++) p2[i]=i;
    sort(p+1,p+1+n,[](int x,int y){return a[x]!=a[y]?a[x]<a[y]:b[x]<b[y];});
    sort(p2+1,p2+1+m,[](int x,int y){return c[x]!=c[y]?c[x]<c[y]:d[x]<d[y];});
    int rr=0,res=0;
    for (int l=1;l<=n;l++) {
        int r=l;
        while (r+1<=n && a[p[r+1]]==a[p[r]]) r++;
        while (rr+1<=m && c[p2[rr+1]]<a[p[l]]) rr++;
        flow::totn++;
        for (int u=l;u<r;u++) {
            int L=0;
            while (rr+1<=m && c[p2[rr+1]]==a[p[u]] && d[p2[rr+1]]<b[p[u]]) rr++;
            while (rr+1<=m && c[p2[rr+1]]==a[p[u]] && d[p2[rr+1]]<b[p[u+1]]) {
                cnt2[p2[rr+1]].pb(flow::totn);
                rr++;L=1;
            }
            res+=!L;
        }
        l=r;
    }
    int L=flow::totn;
    for (int i=1;i<=n;i++) swap(a[i],b[i]);
    for (int i=1;i<=m;i++) swap(c[i],d[i]);
    sort(p+1,p+1+n,[](int x,int y){return a[x]!=a[y]?a[x]<a[y]:b[x]<b[y];});
    sort(p2+1,p2+1+m,[](int x,int y){return c[x]!=c[y]?c[x]<c[y]:d[x]<d[y];});
    rr=0;
    for (int l=1;l<=n;l++) {
        int r=l;
        while (r+1<=n && a[p[r+1]]==a[p[r]]) r++;
        while (rr+1<=m && c[p2[rr+1]]<a[p[l]]) rr++;
        flow::totn++;
        for (int u=l;u<r;u++) {
            int L=0;
            while (rr+1<=m && c[p2[rr+1]]==a[p[u]] && d[p2[rr+1]]<b[p[u]]) rr++;
            while (rr+1<=m && c[p2[rr+1]]==a[p[u]] && d[p2[rr+1]]<b[p[u+1]]) {
                cnt2[p2[rr+1]].pb(flow::totn);
                rr++;L=1;
            }
            res+=!L;
        }
        l=r;
    }

    flow::S=++flow::totn;
    flow::T=++flow::totn;
    for (int w=1;w<=L;w++) flow::add_edge(flow::S,w,1,0);
    for (int w=L+1;w<=flow::totn-2;w++) flow::add_edge(w,flow::T,1,0);

    for (int i=1;i<=m;i++) {
        if (cnt2[i].size()<=1) continue;
        flow::add_edge(cnt2[i][0],cnt2[i][1],1,i);
    }
    int Sum=m-k;
    flow::main();
    for (int i=1;i<=m;i++) Sum-=!!vis5[i],res+=(!!vis5[i])*2;
    // cerr<<Sum<<" qweroj\n";
    for (int i=1;i<=m;i++) {
        if (vis5[i]) continue;
        if (!Sum) break;
        if (cnt2[i].size()==1) {
            if (vis3[cnt2[i][0]] || vis4[cnt2[i][0]]) continue;
            Sum--;vis5[i]=1;res++;
        } 
    }
    for (int i=1;i<=m;i++) {
        if (vis5[i]) continue;
        if (!Sum) break;
        Sum--;vis5[i]=1;
    }

    cout<<res<<"\n";
    for (int w=1;w<=m;w++)
        if (!vis5[w]) cout<<w<<" ";
    cout<<"\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    int t=0;cin>>t;
    while (t--) solve();
    return 0;
}