#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);
		H *= 2;
		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) % H;
				if(mp.find(k) != mp.end()) mp[k] ++;
				ans = max(ans,mp[k]);
				LL _k = (H - a[i].y + a[i].x) % H;
				if(k == _k) continue;
				if(mp.find(_k) != mp.end()) mp[_k] ++;
				ans = max(ans,mp[_k]);
			}
			else
			{
				LL k = (a[i].x + a[i].y) % H;
				LL _k = (H - a[i].y + a[i].x) % H;
				if(mp.find(k) == mp.end() && mp.find(_k) == mp.end()) continue;
				LL now = max(mp[k],mp[_k]);
				ans = max(ans,now);
				mp[k] = now; mp[_k] = now;
			}
		}
		printf("%lld\n",ans);
	}
	return (0 ^ 0);
}
/*
1
10
19
2 4
2 8
8 3
8 4
8 7
2 7
2 6
1 5
3 2
6 4
2 1
4 5
2 5
7 1
4 7
5 7
2 2
8 6
8 1
12
5 1
4 8
5 2
6 1
3 6
1 1
1 7
7 2
5 6
6 8
1 2
3 5
*/