#include<bits/stdc++.h>
#define ll long long

using namespace std;

const int N = 2e5 + 10;

struct node {
    int x, y, c;
} a[N];
int h, n, m;

bool cmp(node i, node j) {
    return i.x < j.x;
}
map<int, int>ha, hb;
//ha x-y hb x+y
int get(int x, int y, bool tag) {
    int res = 0;
    int a = ((x - y) % (2 * h) + 2 * h) % (2 * h), b = ((x + y) % (2 * h) + 2 * h) % (2 * h);
    if (tag) {
        if (hb.count(a))res = max(res, hb[a]);
        if (ha.count(a))res = max(res, ha[a]);
    }
    else {
        if (ha.count(b))res = max(res, ha[b]);
        if (hb.count(b))res = max(res, hb[b]);
    }
    return res;
}

void solve()
{
    cin >> h >> n;
    ha.clear(), hb.clear();
    for (int i = 1; i <= n; i++)cin >> a[i].x >> a[i].y, a[i].c = 0;
    cin >> m;
    for (int i = 1; i <= m; i++)cin >> a[i + n].x >> a[i + n].y, a[i + n].c = 1;
    sort(a + 1, a + 1 + n + m, cmp);
    ha[0] = 1; int ans = 1;
    for (int i = 1; i <= n + m; i++) {
        int x = a[i].x, y = a[i].y;
        int s = ((x - y) % (2 * h) + 2 * h) % (2 * h), t = ((x + y) % (2 * h) + 2 * h) % (2 * h);
        if (a[i].c) {
            int res0 = get(a[i].x, a[i].y, 0),            res1 = get(a[i].x, a[i].y, 1);
            if (res0)ha[s] = max(ha[s], res0 + 1), ans = max(ans, res0 + 1);
            //cout << x << ' ' << y << ' ' << a[i].c << ' ' << res << endl;

            if (res1)hb[t] = max(hb[t], res1 + 1), ans = max(ans, res1 + 1);
            //cout << x << ' ' << y << ' ' << a[i].c << ' ' << ans << endl;
        }
        else {
            int res = max(get(a[i].x, a[i].y, 1), get(a[i].x, a[i].y, 0));
            ha[s] = max(ha[s], res), hb[t] = max(hb[t], res);
            //cout << x << ' ' << y << ' ' << a[i].c << ' ' << res << endl;
        }
    }
    cout << ans - 1 << '\n';

}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t; cin >> t;
    while (t--)solve();
    return 0;
}