#include <bits/stdc++.h>
using namespace std;

const long long MAXC = 300000;
const long long MAXV = 700000;

int nt, ns, r;

long long hash_pt(pair<int, int> p) {
  return (long long) (p.first + MAXC) * MAXV + (p.second + MAXC);
}

vector<pair<int, int>> find_loc(pair<int, int> points[], pair<int, int> sensed[]) {
  set<long long> glob_set;
  set<long long> sense_set;
  for (int i = 0; i < nt; i++) {
    glob_set.insert(hash_pt(points[i]));
  }
  for (int i = 0; i < ns; i++) {
    sense_set.insert(hash_pt(sensed[i]));
  }

  vector<pair<int, int>> res;
  for (int i = 0; i < nt; i++) {
    int x = points[i].first - sensed[0].first;
    int y = points[i].second - sensed[0].second;
    long long r_hash = hash_pt({x, y});
    if (glob_set.count(r_hash)) {
      continue;
    }
    
    bool works = true;
    for (int j = 0; j < ns; j++) {
      long long glob_point = hash_pt({x + sensed[j].first, y + sensed[j].second});
      if (!glob_set.count(glob_point)) {
	works = false;
	break;
      }
    }
    for (int j = 0; j < nt; j++) {
      int dist = abs(points[j].first - x) + abs(points[j].second - y);
      long long loc_point = hash_pt({points[j].first - x, points[j].second - y});
      if (dist <= r && !sense_set.count(loc_point)) {
	works = false;
	break;
      }
    }
    if (works) {
      res.push_back({x, y});
    }
  }
  return res;
}

pair<int, int> rotate_pt(pair<int, int> pt) {
  return {-pt.second, pt.first};
}

void rotate(int n, pair<int, int> pts[]) {
  for (int i = 0; i < n; i++) {
    pts[i] = rotate_pt(pts[i]);
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  cin >> nt >> ns >> r;
  pair<int, int> points[nt];
  pair<int, int> sensed[ns];
  for (int i = 0; i < nt; i++) {
    cin >> points[i].first >> points[i].second;
  }
  for (int i = 0; i < ns; i++) {
    cin >> sensed[i].first >> sensed[i].second;
  }

  vector<pair<int, int>> res;
  for (int i = 0; i < 4; i++) {
    vector<pair<int, int>> cur = find_loc(points, sensed);
    for (int j = 0; j < (int) cur.size(); j++) {
      pair<int, int> add = cur[j];
      for (int k = i; k < 4; k++) {
	add = rotate_pt(add);
      }
      res.push_back(add);
    }
    rotate(nt, points);
  }

  if (res.size() == 0) {
    cout << "Impossible" << endl;
  } else if (res.size() == 1) {
    cout << res[0].first << " " << res[0].second << endl;
  } else {
    cout << "Ambiguous" << endl;
  }
}