#include <bits/stdc++.h>

struct Point {
    int x, y;
    bool type;
};

void solve() {
    int H;
    std::cin >> H;

    int n;
    std::cin >> n;
    std::vector<Point> p;
    for (int i = 0; i < n; ++i) {
        int x, y;
        std::cin >> x >> y;
        p.push_back(Point{x, y, false});
    }

    int m;
    std::cin >> m;
    for (int i = 0; i < m; ++i) {
        int x, y;
        std::cin >> x >> y;
        p.push_back(Point{x, y, true});
    }

    p.push_back(Point{0, 0, false});

    std::sort(p.begin(), p.end(), [](const Point &a, const Point &b) {
        return a.x < b.x;
    });

    const int N = p.size();
    std::map<int, std::pair<int, int>> last;
    std::vector<std::vector<int>> adj(N);
    std::vector<int> dp(N);

    for (int i = N - 1; i >= 0; --i) {
        int u = (p[i].x + p[i].y) % (H * 2);
        int v = (p[i].x - p[i].y) % (H * 2);

        if (!p[i].type) {
            for (int next : {u, v}) {
                auto &[x, val] = last[next];
                dp[i] = std::max(dp[i], dp[x] + val);
                x = i, val = 0;
            }
        } else {
            for (int next : {u, v}) {
                auto &[x, val] = last[next];
                val += 1;
            }
        }
    }

    std::cout << dp[0] << '\n';
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;

    while (t--) {
        solve();
    }
}