#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 10;
long long x[maxn], y[maxn];
int kase = 1;
vector<long long> v[4];
int main(int argc, char const *argv[]) {
  int n, m;
  scanf("%d%d", &n, &m);
  int p, q;
  scanf("%d", &p);
  for (int i = 1; i <= p; i++) {
    scanf("%lld%lld", &x[i], &y[i]);
    v[0].push_back(x[i] + y[i]);
    v[1].push_back(-x[i] - y[i]);
    v[2].push_back(x[i] - y[i]);
    v[3].push_back(-x[i] + y[i]);
  }
  for (int i = 0; i < 4; i++) sort(v[i].begin(), v[i].end());
  scanf("%d", &q);
  long long ans = 2e9 + 10, t = 1;
  long long a[10];
  for (int i = 1; i <= q; i++) {
    scanf("%lld%lld", &x[i], &y[i]);
    a[0] = x[i] + y[i];
    a[1] = -x[i] - y[i];
    a[2] = x[i] - y[i];
    a[3] = -x[i] + y[i];
    int mx = 0;
    for (int k = 0; k < 4; k++) {
      if (a[k] + v[k ^ 1][p - 1] > mx) mx = a[k] + v[k ^ 1][p - 1];
    }
    if (mx < ans) ans = mx, t = i;
  }
  printf("%lld\n%lld\n", ans, t);
}
