#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int xp, yp, xh[N], yh[N], d[5], D[5], dis[N];
int main() {
  int n, m, c, h, i, j, pos = 1;
  scanf("%d%d", &n, &m);
  scanf("%d", &c);
  memset(d, -0x3f3f3f3f, sizeof(d));
  while (c--) {
    scanf("%d%d", &xp, &yp);
    d[1] = max(d[1], xp + yp);
    d[2] = max(d[2], -xp + yp);
    d[3] = max(d[3], -xp - yp);
    d[4] = max(d[4], xp - yp);
  }
  scanf("%d", &h);
  for (i = 1; i <= h; i++) {
    scanf("%d%d", &xh[i], &yh[i]);
    D[1] = d[1] - xh[i] - yh[i];
    D[2] = d[2] + xh[i] - yh[i];
    D[3] = d[3] + xh[i] + yh[i];
    D[4] = d[4] - xh[i] + yh[i];
    for (j = 1; j <= 4; j++) {
      if (D[j] > dis[i]) dis[i] = D[j];
    }
    if (dis[i] < dis[pos]) pos = i;
  }
  printf("%d\n%d\n", dis[pos], pos);
  return 0;
}
