#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
const int INF = 1e9;

enum Type
{
    board,
    coin
};
struct Obj
{
    int x, y;
    Type type;
} obj[2 * N];
map<int, int> ans;

bool cmp(Obj a, Obj b) { return a.x < b.x; }
inline int query(int x) { return (ans.find(x) == ans.end() ? -INF : ans[x]); }
int init();
int solve(int cnt, int h);

int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t, h, cnt;
    cin >> t;
    while (t--)
    {
        cin >> h;
        cout << solve(init(), h) << endl;
    }
    return 0;
}

int init()
{
    int n, m, x, y;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> obj[i].x >> obj[i].y;
        obj[i].type = board;
    }
    cin >> m;
    for (int i = n + 1; i <= n + m; i++)
    {
        cin >> obj[i].x >> obj[i].y;
        obj[i].type = coin;
    }
    sort(obj + 1, obj + n + m + 1, cmp);
    ans.clear();
    ans[0] = 0;
    return n + m;
}

int solve(int cnt, int h)
{
    int x, y, pos1, pos2;
    h = 2 * h;
    for (int i = 1; i <= cnt; i++)
    {
        x = obj[i].x, y = obj[i].y;
        pos1 = (x + y) % h, pos2 = (h - y + x) % h;
        if (obj[i].type == coin)
        {
            ans[pos1] = query(pos1) + 1;
            ans[pos2] = query(pos2) + 1;
        }
        else
            ans[pos1] = ans[pos2] = max(ans[pos1], ans[pos2]);
    }
    int ret = 0;
    for (int i = 0; i < h; i++)
        ret = max(ret, query(i));
    return ret;
}