#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 1e5 + 100;
vector<int> node[4];
int mmax[4];
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    node[0].push_back(x + y);
    node[1].push_back(x - y);
    node[2].push_back(y - x);
    node[3].push_back(-x - y);
  }
  for (int i = 0; i < 4; i++)
    mmax[i] = *max_element(node[i].begin(), node[i].end());
  scanf("%d", &n);
  int ans = 2e9, mark = -1;
  for (int i = 1; i <= n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    int res = 0;
    res = max(res, mmax[0] - x - y);
    res = max(res, mmax[1] - x + y);
    res = max(res, mmax[2] - y + x);
    res = max(res, mmax[3] + x + y);
    if (res < ans) {
      ans = res;
      mark = i;
    }
  }
  printf("%d\n%d\n", ans, mark);
  return 0;
}
