#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

typedef int ll;
typedef long double ld;

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

    ll n, m, r;
    cin >> n >> m >> r;
    vector<pair<ll, ll>> v;
    while (n--) {
        ll x, y;
        cin >> x >> y;
        v.push_back({x, y});
    }
    set<pair<ll, ll>> s;
    while (m--) {
        ll x, y;
        cin >> x >> y;
        s.insert({x, y});
    }
    if (s.count({0, 0}) == 1) {
        cout << "Impossible";
        return 0;
    }
    set<pair<ll, pair<ll, ll>>> ans;
    ll s1 = (*s.begin()).first;
    ll s2 = (*s.begin()).second;
    ll dx[4] = {s1, -s1, -s2, s2};
    ll dy[4] = {s2, -s2, s1, -s1};
    for (auto p1 : v) {
        for (int i = 0; i < 4; i++) {
            ll x = p1.first - dx[i];
            ll y = p1.second - dy[i];
            ll k = 0;
            bool valid = true;
            for (auto p : v) {
                ll xx, yy;
                if (i == 0) {
                    xx = p.first - x;
                    yy = p.second - y;
                }
                if (i == 1) {
                    xx = x - p.first;
                    yy = y - p.second;
                }
                if (i == 2) {
                    xx = p.second - y;
                    yy = x - p.first;
                }
                if (i == 3) {
                    xx = y - p.second;
                    yy = p.first - x;
                }
                if (abs(xx) + abs(yy) <= r) {
                    valid &= (s.count({xx, yy}) == 1);
                    k += 1;
                    if (!valid)
                        break;
                }
            }

            valid &= k == s.size();
            if (valid)
                ans.insert({i, {x, y}});
        }
    }
    if (ans.size() == 0)
        cout << "Impossible";
    else if (ans.size() > 1)
        cout << "Ambiguous";
    else
        cout << (*ans.begin()).second.first << " " << (*ans.begin()).second.second;
}