#include<bits/stdc++.h>
using namespace std;const int N=2e5+7;
int n,m,cnt,cnt2,h,z1[N],z2[N],x[N],c[N],d[N],f[N];
vector<pair<int,int> >G[N],G2[N];
void sol(){
	scanf("%d%d",&h,&n);h+=h;cnt=0;d[cnt2=1]=0;
	for(int i=1,y;i<=n;++i){
		scanf("%d%d",&x[i],&y);c[++cnt]=x[i];
		z1[i]=(1ll*h+(x[i]-y)%h)%h,z2[i]=(x[i]+y)%h;
		d[++cnt2]=z1[i];d[++cnt2]=z2[i];
	}
	scanf("%d",&m);
	for(int i=n+1,y;i<=m+n;++i){
		scanf("%d%d",&x[i],&y);c[++cnt]=x[i];
		z1[i]=(1ll*h+(x[i]-y)%h)%h,z2[i]=(x[i]+y)%h;
		d[++cnt2]=z1[i];d[++cnt2]=z2[i];
	}
	sort(c+1,c+cnt+1);cnt=unique(c+1,c+cnt+1)-c-1;
	sort(d+1,d+cnt2+1);cnt2=unique(d+1,d+cnt2+1)-d-1;
	for(int i=1;i<=n;++i)
	G[lower_bound(c+1,c+cnt+1,x[i])-c].push_back(
	{lower_bound(d+1,d+cnt2+1,z1[i])-d,lower_bound(d+1,d+cnt2+1,z2[i])-d});
	for(int i=n+1;i<=n+m;++i)
	G2[lower_bound(c+1,c+cnt+1,x[i])-c].push_back(
	{lower_bound(d+1,d+cnt2+1,z1[i])-d,lower_bound(d+1,d+cnt2+1,z2[i])-d});
	for(int i=1;i<=cnt2;++i)f[i]=-1e9;f[1]=0;
	for(int i=1;i<=cnt;++i){
		for(auto j:G[i])f[j.first]=f[j.second]=max(f[j.first],f[j.second]);
		for(auto j:G2[i])f[j.first]++,f[j.second]++;
		G[i].clear();G2[i].clear();
	}
	int ans=0;for(int i=1;i<=cnt2;++i)ans=max(ans,f[i]);printf("%d\n",ans);
}
int main(){int t;scanf("%d",&t);while(t--)sol();return 0;}