#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
#include<bitset>
#include<set> 
#define ll long long
#define lowbit(x) x&(-x)
#define mp make_pair
#define rep(i,x,n) for(int i=x;i<=n;i++)
#define per(i,n,x) for(int i=n;i>=x;i--)
#define forE(i,x) for(int i=head[x];i;i=nxt[i])
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int maxn=1e6+5;
const int mod=998244353;
const int INF=1e9;
inline int read()
{
	int x=0,f=1;char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=x*10+(c-'0');
		c=getchar();
	}
	return x*f;
}
int T;
struct node{
    ll x,y,t;
}a[maxn];
map<ll,int> p[2];
signed main()
{
	T=read();
	while(T--)
	{
        p[0].clear(),p[1].clear();
        ll H=read();
        int n=read(),tot=0;
        rep(i,1,n) a[++tot]={read(),read(),0};
        int m=read();
        rep(i,1,m) a[++tot]={read(),read(),1};
        sort(a+1,a+tot+1,[&](node u,node v)->bool {return u.x<v.x;});
        int ans=1;
        p[0][0] = 1;
        p[1][0] = 1;
        rep(i,1,tot)
        {
            ll x=a[i].x,y=a[i].y,t=a[i].t;
            int up = p[0][(x-y)%(2*H)];
            int down = p[1][(x+y)%(2*H)];
            if(up==0) up=-INF;
            if(down==0) down=-INF;
            ans=max(ans,max(up,down)+(t==1));
            if(t==1) 
            {
                p[0][(x-y)%(2*H)] = max(p[0][(x-y)%(2*H)],up+1);
                int topx=H-y+x,topy=H;
                p[1][(topx+topy)%(2*H)] = max(p[1][(topx+topy)%(2*H)],up+1);
                p[1][(x+y)%(2*H)] = max(p[1][(x+y)%(2*H)],down+1);
                int lowx=x+y,lowy=0;
                p[0][(lowx-lowy)%(2*H)] = max(p[0][(lowx-lowy)%(2*H)],down+1);
            }
            else
            {
                int v=max(up,down);
                p[0][(x-y)%(2*H)] = max(p[0][(x-y)%(2*H)],v);
                int topx=H-y+x,topy=H;
                p[1][(topx+topy)%(2*H)] = max(p[1][(topx+topy)%(2*H)],v);
                p[1][(x+y)%(2*H)] = max(p[1][(x+y)%(2*H)],v);
                int lowx=x+y,lowy=0;
                p[0][(lowx-lowy)%(2*H)] = max(p[0][(lowx-lowy)%(2*H)],v);                
            }      
        }
        printf("%d\n",ans-1);
	}
}