#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (b < a) {
    long long int temp = a;
    a = b;
    b = temp;
  }
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return (a * b / gcd(a, b));
}
long long int fact(long long int x) {
  long long int ans = 1;
  if (x == 0) {
    return 1;
  }
  while (x > 0) {
    ans = (ans * x);
    x--;
  }
  return ans;
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      ans *= a;
      ans = ans;
    }
    b /= 2;
    a *= a;
    a = a;
  }
  return ans;
}
vector<long long int> getbinary(int x) {
  vector<long long int> bin(10, 0);
  long long int iter = 0;
  while (x > 0) {
    if (x % 2 == 1) {
      bin[iter] = 1;
    } else {
      bin[iter] = 0;
    }
    iter++;
    x /= 2;
  }
  return bin;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int n, m, c, h, y = 1e18, ind, i, j;
  cin >> n >> m;
  cin >> c;
  long long int a[c][2], x1 = 0, x2 = 0, x3 = 0, x4 = 0;
  for (i = 0; i < c; i++) {
    cin >> a[i][0] >> a[i][1];
    if (i != 0) {
      if (a[i][0] + a[i][1] > a[x1][0] + a[x1][1]) x1 = i;
      if (a[i][0] - a[i][1] > a[x2][0] - a[x2][1]) x2 = i;
      if (-a[i][0] + a[i][1] > -a[x3][0] + a[x3][1]) x3 = i;
      if (-a[i][0] - a[i][1] > -a[x4][0] - a[x4][1]) x4 = i;
    }
  }
  cin >> h;
  for (i = 0; i < h; i++) {
    cin >> n >> m;
    long long int x = abs(n - a[x1][0]) + abs(m - a[x1][1]);
    x = max(x, abs(n - a[x2][0]) + abs(m - a[x2][1]));
    x = max(x, abs(n - a[x3][0]) + abs(m - a[x3][1]));
    x = max(x, abs(n - a[x4][0]) + abs(m - a[x4][1]));
    if (x < y) {
      y = x;
      ind = i + 1;
    }
  }
  cout << y << endl << ind;
}
