#include <bits/stdc++.h>
using namespace std;
const int INF = int(1e9);
const long long INFll = 1ll * INF * INF;
const int MOD = 1000000007;
bool comp2(pair<int, int> a, pair<int, int> b) {
  return ((a.first + a.second) < (b.first + b.second));
}
bool comp3(pair<int, int> a, pair<int, int> b) {
  return ((a.first - a.second) < (b.first - b.second));
}
int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  int c;
  cin >> c;
  vector<pair<int, int> > x(c);
  for (int i = 0; i < c; ++i) cin >> x[i].first >> x[i].second;
  int h;
  cin >> h;
  vector<int> x1(h), y1(h);
  for (int i = 0; i < h; ++i) cin >> x1[i] >> y1[i];
  int ans1 = 2 * INF + 500, ans2;
  vector<pair<int, int> > p;
  sort(x.begin(), x.end(), comp2);
  p.push_back(x[0]);
  p.push_back(x.back());
  sort(x.begin(), x.end(), comp3);
  p.push_back(x[0]);
  p.push_back(x.back());
  for (int i = 0; i < h; ++i) {
    int cur = 0;
    for (int j = 0; j < p.size(); ++j)
      cur = max(cur, abs(x1[i] - p[j].first) + abs(y1[i] - p[j].second));
    if (cur < ans1) {
      ans1 = cur;
      ans2 = i + 1;
    }
  }
  cout << ans1 << endl << ans2;
  return 0;
}
