#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n,m,x[2005],y[2005],r[2005],c[2005];
ll px[2005],py1[2005],py2[2005],pcnt=0;
ll qy[2005],qx1[2005],qx2[2005],qcnt=0;
ll head[200005],nxt[400005],to[400005],cnt=0;
void addedge(int u,int v){
	cnt++;
	to[cnt]=v;
	nxt[cnt]=head[u];
	head[u]=cnt;
}
ll pv[2005],qv[2005],dfn,vis[2005];
ll ans,ansx[2005],ansy[2005];
bool dfs(int now){
	vis[now]=dfn;
	for(int i=head[now];i;i=nxt[i]){
		if(qv[to[i]]==-1){
			qv[to[i]]=now;
			pv[now]=to[i];
			return 1;
		}
	}
	for(int i=head[now];i;i=nxt[i]){
		if(vis[qv[to[i]]]!=dfn&&dfs(qv[to[i]])){
			qv[to[i]]=now;
			pv[now]=to[i];
			return 1;
		}
	}
	return 0;
}
void solve(){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++)
		scanf("%lld %lld",&x[i],&y[i]);
	scanf("%lld",&m);
	for(int i=1;i<=m;i++)
		scanf("%lld %lld",&r[i],&c[i]);
	pcnt=0;qcnt=0;
	
	//横边 
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			if(x[i]!=x[j])
				continue;
			bool fl=0;
			for(int k=1;k<=n;k++){
				if(k==i||k==j)
					continue;
				if(x[k]==x[i]&&(y[i]-y[k])*(y[j]-y[k])<0){
					fl=1;break;
				}
			}
			if(fl==1)
				continue;
			for(int k=1;k<=m;k++){
				if(r[k]==x[i]&&(y[i]-c[k])*(y[j]-c[k])<0){
					fl=1;break;
				}
			}
			if(fl==0){
				pcnt++;
				px[pcnt]=x[i];
				py1[pcnt]=min(y[i],y[j])+1;
				py2[pcnt]=max(y[i],y[j])-1;
				if(py1[pcnt]>py2[pcnt]){
					printf("-1\n");
					return;
				}
			}
		}
	}
	
	//竖边 
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			if(y[i]!=y[j])
				continue;
			bool fl=0;
			for(int k=1;k<=n;k++){
				if(k==i||k==j)
					continue;
				if(y[k]==y[i]&&(x[i]-x[k])*(x[j]-x[k])<0){
					fl=1;break;
				}
			}
			if(fl==1)
				continue;
			for(int k=1;k<=m;k++){
				if(c[k]==y[i]&&(x[i]-r[k])*(x[j]-r[k])<0){
					fl=1;break;
				}
			}
			if(fl==0){
				qcnt++;
				qy[qcnt]=y[i];
				qx1[qcnt]=min(x[i],x[j])+1;
				qx2[qcnt]=max(x[i],x[j])-1;
				if(qx1[qcnt]>qx2[qcnt]){
					printf("-1\n");
					return;
				}
			}
		}
	}
	
	//建边 
	cnt=0;
	for(int i=1;i<=pcnt+qcnt;i++)
		head[i]=0;
	for(int i=1;i<=pcnt;i++)
		for(int j=1;j<=qcnt;j++){
			if(qx1[j]<=px[i]&&px[i]<=qx2[j]&&py1[i]<=qy[j]&&qy[j]<=py2[i]){
				addedge(i,pcnt+j);
				addedge(pcnt+j,i);
			}
		}
	
	dfn=0;
	for(int i=1;i<=pcnt;i++)
		pv[i]=-1;
	for(int i=1;i<=qcnt;i++)
		qv[i+pcnt]=-1;
	while(1){
		dfn++;
		int tmp=0;
		for(int i=1;i<=pcnt;i++)
			if(pv[i]==-1&&dfs(i))
				tmp++;
		if(tmp==0)
			break;
	}
	
	ans=0;
	for(int i=1;i<=pcnt;i++){
		if(pv[i]==-1){
			ansx[++ans]=px[i];
			ansy[ans]=py1[i];
		}
		else{
			ansx[++ans]=px[i];
			ansy[ans]=qy[pv[i]-pcnt];
		}
	}
	for(int i=1;i<=qcnt;i++){
		if(qv[i+pcnt]==-1){
			ansx[++ans]=qx1[i];
			ansy[ans]=qy[i];
		}
	}
	printf("%lld\n",ans);
	for(int i=1;i<=ans;i++)
		printf("%lld %lld\n",ansx[i],ansy[i]);
}
int main(){
	int t;scanf("%d",&t);
	while(t--){
		solve();
	}
}