#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int x, y;
int n, m;
int a[200000][2];
pair<int, int> c[200000];
int b[200000][2];
int u[8];
int ui;
int getx(int x, int y, int z) {
  int i;
  for (i = 0; i < n; i++) {
    if (x == 0 && y == 0 && z == 0)
      c[i] = pair<int, int>(a[i][0] + a[i][1], a[i][0] - a[i][1]);
    if (x == 0 && y == 0 && z == 1)
      c[i] = pair<int, int>(a[i][0] + a[i][1], -(a[i][0] - a[i][1]));
    if (x == 0 && y == 1 && z == 0)
      c[i] = pair<int, int>(-(a[i][0] + a[i][1]), a[i][0] - a[i][1]);
    if (x == 0 && y == 1 && z == 1)
      c[i] = pair<int, int>(-(a[i][0] + a[i][1]), -(a[i][0] - a[i][1]));
    if (x == 1 && y == 0 && z == 0)
      c[i] = pair<int, int>(a[i][0] - a[i][1], a[i][0] + a[i][1]);
    if (x == 1 && y == 0 && z == 1)
      c[i] = pair<int, int>(a[i][0] - a[i][1], -(a[i][0] + a[i][1]));
    if (x == 1 && y == 1 && z == 0)
      c[i] = pair<int, int>(-(a[i][0] - a[i][1]), a[i][0] + a[i][1]);
    if (x == 1 && y == 1 && z == 1)
      c[i] = pair<int, int>(-(a[i][0] - a[i][1]), -(a[i][0] + a[i][1]));
  }
  pair<int, int> ma = c[0];
  int mai = 0;
  for (i = 1; i < n; i++) {
    if (ma < c[i]) {
      ma = c[i], mai = i;
    }
  }
  return mai;
}
int main() {
  int i, j, k;
  scanf("%d%d", &x, &y);
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d%d", &a[i][0], &a[i][1]);
  scanf("%d", &m);
  for (i = 0; i < m; i++) scanf("%d%d", &b[i][0], &b[i][1]);
  for (i = 0; i < 2; i++) {
    for (j = 0; j < 2; j++) {
      for (k = 0; k < 2; k++) u[ui++] = getx(i, j, k);
    }
  }
  int mi = ((1 << 30) - 1) * 2, mii;
  for (i = 0; i < m; i++) {
    int ma = 0;
    for (j = 0; j < ui; j++) {
      ma = max(ma, abs(b[i][0] - a[u[j]][0]) + abs(b[i][1] - a[u[j]][1]));
    }
    if (mi > ma) {
      mi = ma;
      mii = i;
    }
  }
  printf("%d\n%d", mi, mii + 1);
  return 0;
}
