#include<bits/stdc++.h>
using namespace std;
#define int long long
#define db double
const int mod=1e9+7;
const int N=2e5+100;
const db PI=acos(-1);
int T,n,m,H,cnt,ans;
map<int,int> f;
struct node
{
    int x,y,id;
}a[N];
bool cmp(node a,node b)
{
    if(a.x==b.x) return a.y<b.y;
    return a.x<b.x;
}
void init()
{
    for(int i=1;i<=cnt;i++)
    {
        f[(a[i].x+a[i].y)%H]=f[(a[i].x-a[i].y+H)%H]=0;
    }
    cnt=ans=0;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>T;
    while(T--)
    {
        cin>>H>>n;
        H*=2;
        for(int i=1;i<=n;i++)
        {
            int x,y;
            cin>>x>>y;
            a[++cnt].id=0;
            a[cnt].x=x,a[cnt].y=y;
        }
        cin>>m;
        for(int i=1;i<=m;i++)
        {
            int x,y;
            cin>>x>>y;
            a[++cnt].id=1;
            a[cnt].x=x,a[cnt].y=y;
        }
        sort(a+1,a+1+cnt,cmp);
        for(int i=1;i<=cnt;i++)
        {
            int v1=(a[i].x+a[i].y)%H,v2=(a[i].x-a[i].y+H)%H;
            if(!a[i].id)
            {
                f[v1]=f[v2]=max(f[v1],f[v2]);
            }
            else
            {
                f[v1]++;
                f[v2]++;
            }
            ans=max(ans,max(f[v1],f[v2]));
            // cout<<i<<" : "<<a[i].x<<" "<<a[i].y<<" "<<v1<<" "<<v2<<" "<<f[v1]<<" "<<f[v2]<<endl;
        }
        cout<<ans<<"\n";
        init();
    }
}