#include <bits/stdc++.h>
using namespace std;
int N, M, X, Y;
int p1, p2, p3, p4;
int main() {
  p1 = -2001000000;
  p2 = -p1;
  p3 = p1;
  p4 = p2;
  scanf("%d%d", &N, &M);
  scanf("%d", &N);
  for (int(i) = 0; (i) < (N); (i)++) {
    scanf("%d%d", &X, &Y);
    p1 = max(p1, X + Y);
    p2 = min(p2, X + Y);
    p3 = max(p3, X - Y);
    p4 = min(p4, X - Y);
  }
  long long res = 1145141919810100081LL;
  int pos = -1;
  scanf("%d", &M);
  for (int(i) = 0; (i) < (M); (i)++) {
    scanf("%d%d", &X, &Y);
    long long s1 = X + Y, s2 = X - Y;
    long long dist = max(max(llabs(s1 - p1), llabs(s1 - p2)),
                         max(llabs(s2 - p3), llabs(s2 - p4)));
    if (dist < res) res = dist, pos = i + 1;
  }
  cout << res << endl << pos << endl;
}
