#include <bits/stdc++.h>
using namespace std;
int z, n, m, a, b, h, r, x, y;
vector<pair<long long, long long> > hotels, rest;
long long x1, x2, y11, y2, resid;
void squeeze(long long x3, long long x4, long long y3, long long y4) {
  x1 = max(x1, x3);
  x2 = min(x2, x4);
  y11 = max(y11, y3);
  y2 = min(y2, y4);
}
bool check(long long m) {
  x1 = -1000000000000, x2 = 1000000000000;
  y11 = -1000000000000, y2 = 1000000000000;
  for (int i = 0; i < hotels.size(); i++)
    squeeze(hotels[i].first - m, hotels[i].first + m, hotels[i].second - m,
            hotels[i].second + m);
  for (int i = 0; i < rest.size(); i++) {
    if (rest[i].first >= x1 && rest[i].first <= x2 && rest[i].second >= y11 &&
        rest[i].second <= y2) {
      resid = i;
      return true;
    }
  }
  return false;
}
int main() {
  scanf("%d%d", &n, &m);
  scanf("%d", &h);
  for (int i = 0; i < h; i++) {
    scanf("%d%d", &x, &y);
    hotels.push_back(make_pair(x + y, x - y));
  }
  scanf("%d", &r);
  for (int i = 0; i < r; i++) {
    scanf("%d%d", &x, &y);
    rest.push_back(make_pair(x + y, x - y));
  }
  long long left = 0, right = 1000000000000;
  while (left < right) {
    long long m = (left + right) / 2;
    if (check(m))
      right = m;
    else
      left = m + 1;
  }
  cout << left << endl;
  cout << resid + 1 << endl;
  return 0;
}
