#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pr pair<int,int>
#define _(x,y) x=(x+y)%mod
#define ll long long
int read(){int d=1,k=0;char c=getchar();
while(!(c>='0' and c<='9' or c=='-'))c=getchar();if(c=='-')d=-1,c=getchar();
while(c>='0' and c<='9')k=(k<<3)+(k<<1)+(c^48),c=getchar();return d*k;}
#define N 405
int n,m,X[N],Y[N],lsh[N],cnt,S,T;
#define fi first
#define se second
vector<pair<int,int> > row[N];
vector<pair<int,pair<int,int> > > L,R;
struct edge{
    int b,c,n;
}e[N*N*10];
int h[N*10],tot=1;
inline void charu(int a,int b,int c){
    e[++tot].b=b,e[tot].c=c,e[tot].n=h[a],h[a]=tot;
    e[++tot].b=a,e[tot].c=0,e[tot].n=h[b],h[b]=tot;
}
queue<int> q;
int dep[N*5],cur[N*5];
inline bool bfs(){
    memset(dep,-1,sizeof(dep));
    memcpy(cur,h,sizeof(cur));
    dep[S]=0,q.push(S);
    while(!q.empty()){
        int u=q.front();
        q.pop();
        for(int i=h[u];i;i=e[i].n){
            int v=e[i].b;
            if(e[i].c && dep[v]==-1){
                dep[v]=dep[u]+1;
                q.push(v);
            }
        }
    }
    return dep[T]!=-1;
}
int dfs(int u,int limit){
    if(u==T || limit==0) return limit;
    int flow=0,tmp;
    for(int &i=cur[u];i;i=e[i].n){
        int v=e[i].b;
        if(dep[u]+1==dep[v] && e[i].c && (tmp=dfs(v,min(limit,e[i].c)))){
            e[i].c-=tmp,e[i^1].c+=tmp;
            flow+=tmp,limit-=tmp;
            if(!limit) break;
        }
    }
    return flow;
}
inline int dinic(){
    int maxflow=0;
    while(bfs()){
        maxflow+=dfs(S,1e9);
    }
    return maxflow;
}
signed main(){
    for(int cas=read();cas--;){
        L.clear(),R.clear();
        n=read();
        for(int i=1;i<=n;++i){
            X[i]=read(),Y[i]=read();
        }
        m=read();
        for(int i=1;i<=m;++i){
            X[i+n]=read(),Y[i+n]=read();
        }
        cnt=0;
        for(int i=1;i<=n+m;++i) lsh[++cnt]=X[i];
        sort(lsh+1,lsh+cnt+1);
        cnt=unique(lsh+1,lsh+cnt+1)-lsh-1;
        for(int i=1;i<=n+m;++i){
            int tmp=lower_bound(lsh+1,lsh+cnt+1,X[i])-lsh;
            row[tmp].push_back({Y[i],i});
        }
        int flag=1,ans=0;
        for(int i=1;i<=cnt;++i){
            sort(row[i].begin(),row[i].end());
            for(int j=0;j+1<row[i].size();++j){
                if(row[i][j].se<=n && row[i][j+1].se<=n){
                    if(row[i][j].fi+1==row[i][j+1].fi){
                        flag=0;
                    }
                    L.push_back({lsh[i],{row[i][j].fi,row[i][j+1].fi}});
                    ans++;
                }
            }
            row[i].clear();
        }
        cnt=0;
        for(int i=1;i<=n+m;++i) lsh[++cnt]=Y[i];
        sort(lsh+1,lsh+cnt+1);
        cnt=unique(lsh+1,lsh+cnt+1)-lsh-1;
        for(int i=1;i<=n+m;++i){
            int tmp=lower_bound(lsh+1,lsh+cnt+1,Y[i])-lsh;
            row[tmp].push_back({X[i],i});
        }
        for(int i=1;i<=cnt;++i){
            sort(row[i].begin(),row[i].end());
            for(int j=0;j+1<row[i].size();++j){
                if(row[i][j].se<=n && row[i][j+1].se<=n){
                    if(row[i][j].fi+1==row[i][j+1].fi){
                        flag=0;
                    }
                    R.push_back({lsh[i],{row[i][j].fi,row[i][j+1].fi}});
                    ans++;
                }
            }
            row[i].clear();
        }
        int pool=0;
        if(flag){
            pool=L.size()+R.size()+1;
            S=pool-1,T=pool;
            for(int i=0;i<L.size();++i) charu(S,i,1);
            for(int i=0;i<R.size();++i) charu(i+L.size(),T,1);
            for(int i=0;i<L.size();++i){
                auto u=L[i];
                for(int j=0;j<R.size();++j){
                    auto v=R[j];
                    if(u.se.fi<v.fi && v.fi<u.se.se && v.se.fi<u.fi && u.fi<u.se.se){
                        charu(i,j+L.size(),1);
                    }
                }
            }
            printf("%d\n",ans-dinic());
            for(int i=2;i<=tot;i+=2){
                if(e[i].b==T || e[i^1].b==S) continue;
                if(!e[i].c){
                    int u=e[i^1].b,v=e[i].b-L.size();
                    printf("%d %d\n",L[u].fi,R[v].fi);
                }
            }
            for(int i=2;i<=tot;i+=2){
                if(e[i].c && e[i^1].b==S){
                    int u=e[i].b;
                    printf("%d %d\n",L[u].fi,L[u].se.fi+1);
                }
            }
            for(int i=2;i<=tot;i+=2){
                if(e[i].c && e[i].b==T){
                    int v=e[i^1].b-L.size();
                    printf("%d %d\n",R[v].se.fi+1,R[v].fi);
                }
            }
        }
        else{
            puts("-1");
        }
        tot=1;
        for(int i=0;i<=pool;++i) h[i]=0;
    }
	return 0;
}