#include <bits/stdc++.h>
using namespace std;
const int maxn = 550;
const int MOD = 1e9 + 7;
const double eps = 1e-8;
const long long INF = 0x3f3f3f3f;
long long maxs(long long x1, long long x2) { return (x1 > x2) ? x1 : x2; }
int main() {
  int n, m;
  scanf("%d %d", &n, &m);
  int hotel, restaurant;
  scanf("%d", &hotel);
  long long tmp1, tmp2;
  int first = 1;
  long long ff, zz, fz, zf;
  for (int i = 0; i < hotel; ++i) {
    scanf("%lld %lld", &tmp1, &tmp2);
    if (first) {
      ff = -tmp1 - tmp2;
      zz = tmp1 + tmp2;
      fz = -tmp1 + tmp2;
      zf = tmp1 - tmp2;
      first = 0;
    } else {
      ff = maxs(ff, -tmp1 - tmp2);
      zz = maxs(zz, tmp1 + tmp2);
      fz = maxs(fz, -tmp1 + tmp2);
      zf = maxs(zf, tmp1 - tmp2);
    }
  }
  scanf("%d", &restaurant);
  long long result = INF << 32;
  int flag;
  for (int i = 0; i < restaurant; ++i) {
    scanf("%lld %lld", &tmp1, &tmp2);
    long long tmp = maxs(maxs(tmp1 + tmp2 + ff, tmp1 - tmp2 + fz),
                         maxs(-tmp1 + tmp2 + zf, -tmp1 - tmp2 + zz));
    if (tmp < result) {
      result = tmp;
      flag = i + 1;
    }
  }
  printf("%lld\n%d\n", result, flag);
  return 0;
}
