#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1E9;
int R, C, N, M;
int xy[2][2];
int main() {
  cin >> R >> C;
  cin >> N;
  for (int i = (0); i < (2); i++)
    for (int j = (0); j < (2); j++) xy[i][j] = -INF - INF;
  for (int k = (0); k < (N); k++) {
    int x, y;
    scanf("%d%d", &x, &y);
    for (int i = (0); i < (2); i++)
      for (int j = (0); j < (2); j++) {
        xy[i][j] = max(xy[i][j], x * (i ? -1 : 1) + y * (j ? -1 : 1));
      }
  }
  cin >> M;
  int ans = INF + INF, ansi;
  for (int k = (0); k < (M); k++) {
    int x, y;
    scanf("%d%d", &x, &y);
    int sol = -INF - INF;
    for (int i = (0); i < (2); i++)
      for (int j = (0); j < (2); j++) {
        int d = xy[i][j] + x * (!i ? -1 : 1) + y * (!j ? -1 : 1);
        sol = max(d, sol);
      }
    if (sol < ans) {
      ans = sol;
      ansi = k;
    }
  }
  printf("%d\n%d\n", ans, ansi + 1);
  return 0;
}
