#include <bits/stdc++.h>
using namespace std;
const int INF = 0x7fffffff;
const int maxn = 100005;
int main() {
  int x1, x2, y1, y2, a1, a2, a3, a4;
  int n, m;
  int x, y;
  scanf("%d%d", &x, &y);
  scanf("%d", &n);
  a1 = a3 = a2 = a4 = -INF;
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &x1, &y1);
    a1 = max(a1, x1 + y1);
    a2 = max(a2, -(x1 + y1));
    a3 = max(a3, y1 - x1);
    a4 = max(a4, x1 - y1);
  }
  scanf("%d", &m);
  int ans = INF, re;
  for (int i = 1; i <= m; ++i) {
    scanf("%d%d", &x2, &y2);
    int tp =
        max(max(a1 - x2 - y2, a2 + x2 + y2), max(a3 + x2 - y2, a4 - x2 + y2));
    if (tp < ans) {
      ans = tp;
      re = i;
    }
  }
  printf("%d\n%d\n", ans, re);
  return 0;
}
