#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>

using namespace std;

const int N = 1e5 + 5;

#define LL long long

struct qwq{
	LL x,y,c;
};
qwq a[N * 2];

bool cmp(qwq a,qwq b)
{
	if(a.x != b.x) return a.x < b.x;
	return a.y < b.y;
}

int T,n,m;
LL H;

int main()
{
	scanf("%d",&T);
	while(T --)
	{
		scanf("%lld",&H);
		scanf("%d",&n);
		for(int i = 1;i <= n;i ++)
		{
			scanf("%lld%lld",&a[i].x,&a[i].y);
			a[i].c = 0;
		}
		scanf("%d",&m);
		for(int i = n + 1;i <= n + m;i ++)
		{
			scanf("%lld%lld",&a[i].x,&a[i].y);
			a[i].c = 1;
		}
		sort(a + 1,a + n + m + 1,cmp);
		map <LL,LL> mp;
		mp.clear();
		mp[0] = 0;
		LL ans = 0;
		for(int i = 1;i <= n + m;i ++)
		{
			if(a[i].c == 1)
			{
				LL k = (a[i].x + a[i].y) % (2 * H);
				mp[k] ++;
				ans = max(ans,mp[k]);
				k = (2 * H - a[i].y + a[i].x) % (2 * H);
				mp[k] ++;
				ans = max(ans,mp[k]);
			}
			else
			{
				LL k = (a[i].x + a[i].y) % (2 * H);
				LL _k = (2 * H - a[i].y + a[i].x) % (2 * H);
				LL now = max(mp[k],mp[_k]);
				ans = max(ans,now);
				mp[k] = now; mp[_k] = now;
			}
		}
		printf("%lld\n",ans);
	}
	return (0 ^ 0);
}