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

using i64 = long long;
struct Point {
  i64 x, y;
  bool operator<(Point b) const {
    return x != b.x ? x < b.x : y < b.y;
  }
};

void solve() {
  int H;
  cin >> H;
  H *= 2;
  int n;
  cin >> n;
  vector<pair<Point, int>> a;
  for (int i = 0; i < n; i++) {
    i64 x, y;
    cin >> x >> y;
    a.push_back({{x, y}, 0});
  }
  int m;
  cin >> m;
  for (int i = 0; i < m; i++) {
    i64 x, y;
    cin >> x >> y;
    a.push_back({{x, y}, 1});
  }
  sort(a.begin(), a.end());
  map<i64, int> f;
  f[0] = 0;
  for (int i = 0; i < a.size(); i++) {
    Point &cur = a[i].first;
    int v = a[i].second;
    if (v == 1) {
      i64 n1 = (cur.x + cur.y) % H;
      if (f.find(n1) != f.end()) {
        f[n1]++;
      }
      i64 n2 = (cur.x - cur.y + H) % H;
      if (f.find(n2) != f.end() && n1 != n2) {
        f[n2]++;
      }
    } else {
      i64 n1 = (cur.x + cur.y) % H;
      i64 n2 = (cur.x - cur.y + H) % H;
      if (f.find(n1) == f.end() && f.find(n2) == f.end()) {

      } else {
        f[n1] = f[n2] = max(f[n1], f[n2]);
      }
    }
  }
  int ans = 0;
  for (auto &x : f) {
    ans = max(ans, x.second);
  }
  cout << ans << "\n";
}

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