#include <bits/stdc++.h>
using namespace std;
using LL = long long;

void solve() {
    LL H;
    cin >> H;

    int n;
    cin >> n;
    vector<array<int, 2>> a(n);
    for (int i = 0; i < n; ++i) {
        int x, y;
        cin >> x >> y;
        a[i] = {x, y};
    }

    int m;
    cin >> m;
    vector<array<int, 2>> b(m);
    for (int i = 0; i < m; ++i) {
        int x, y;
        cin >> x >> y;
        b[i] = {x, y};
    }

    sort(a.begin(), a.end());
    sort(b.begin(), b.end());

    map<int, int> mp;
    mp[0] = 0;
    int i = 0, j = 0;
    int ans = 0;            
    while (i < n || j < m) {
        if ((i < n && j < m && a[i][0] < b[j][0]) || (i < n && j == m)) {
            int t1 = (a[i][0] + a[i][1]) % (2 * H);
            int t2 = ((a[i][0] - a[i][1]) % (2 * H) + 2 * H) % (2 * H);
            // cout << t1 << ' ' << t2 << '\n';

            int mx = -1;
            if (mp.find(t1) != mp.end()) {
                mx = max(mx, mp[t1]);
            }
            if (mp.find(t2) != mp.end()) {
                mx = max(mx, mp[t2]);
            }

            if (mx != -1) {
                mp[t1] = mp[t2] = mx;
            }
            ++i;
        } else {
            int t1 = (b[j][0] + b[j][1]) % (2 * H);
            int t2 = ((b[j][0] - b[j][1]) % (2 * H) + 2 * H) % (2 * H);

            // cout << t1 << ' ' << t2 << '\n';
            int mx = -1;
            if (mp.find(t1) != mp.end()) {
                mx = max(mx, mp[t1]);
                mp[t1] += 1;
            }
            if (mp.find(t2) != mp.end()) {
                mx = max(mx, mp[t2]);
                mp[t2] += 1;
            }

            ans = max(ans, mx + 1);
            ++j;
        }
    }
    cout << ans << '\n';
}

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