#include<algorithm>
#include<iostream>
#include<cstdio>
#include<map>
using namespace std;
const int N = 2e5 + 5;
int n, m, H;
struct node{
    int x, y, op;
}nod[N];
map <int, int> f;

int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    int T;
    cin >> T;
    while(T --){
        cin >> H;
        cin >> n;
        for(int i = 1; i <= n; i ++){
            cin >> nod[i].x >> nod[i].y;
            nod[i].op = 0;
        }
        cin >> m;
        for(int i = 1; i <= m; i ++){
            cin >> nod[i + n].x >> nod[i + n].y;
            nod[i + n].op = 1;
        }
        sort(nod + 1, nod + 1 + n + m, [](node x,node y){
            return x.x > y.x;
        });
        f.clear();
        for(int i = 1; i <= n + m; i ++){
            if(nod[i].op){
                f[(nod[i].x + nod[i].y) % (2 * H)] ++;
                f[(0ll + 2 * H - nod[i].y + nod[i].x) % (2 * H)] ++;
            }
            else{
                f[(nod[i].x + nod[i].y) % (2 * H)] = f[(0ll + 2 * H - nod[i].y + nod[i].x) % (2 * H)]
                = max(f[(nod[i].x + nod[i].y) % (2 * H)], f[(0ll + 2 * H - nod[i].y + nod[i].x) % (2 * H)]);
            }
        }
        cout << f[0] << '\n';
    }
    return 0;
}