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

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {cout << '\n';}
template<typename T, typename...U>
void dout (T t, U...u) {cout << t << (sizeof... (u) ? ", " : ""), dout (u...);}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 5005;

int n, m, r;
pair<int, int> p[SIZE], sp[SIZE];

bool fans;
pair<int, int> ans;

int dis(pair<int, int> a, pair<int, int> b) {
    return abs(a.F - b.F) + abs(a.S - b.S);
}

void work() {
    FOR (i, 1, n) {
        int dx = p[i].F - sp[1].F, dy = p[i].S - sp[1].S;
        bool f = 1;
        pair<int, int> mid = {dx, dy};
        int rp = 1;
        FOR (j, 1, n) if (dis(mid, p[j]) <= r) {
            if (rp > m) {
                f = 0;
                break;
            }
            pair<int, int> dsp = {sp[rp].F + dx, sp[rp].S + dy};
            if (p[j] != dsp) {
                f = 0;
                break;
            }
            rp++;
        }
        if (rp <= m) f = 0;
        if (f) {
            if (fans) {
                cout << "Ambiguous\n";
                exit(0);
            }
            fans = 1;
            ans = mid;
        }
    }
}

void solve() {
    cin >> n >> m >> r;
    FOR (i, 1, n) cin >> p[i].F >> p[i].S;
    FOR (i, 1, m) {
        cin >> sp[i].F >> sp[i].S;
        if (sp[i].F == 0 && sp[i].S == 0) {
            cout << "Impossible\n";
            return;
        }
    }

    sort(p + 1, p + n + 1);
    FOR (t, 0, 3) {
        sort(sp + 1, sp + m + 1);
        work();
        FOR (i, 1, m) {
            swap(sp[i].F, sp[i].S);
            sp[i].F *= -1;
        }
    }
    if (fans) cout << ans.F << ' ' << ans.S << '\n';
    else cout << "Impossible\n";
}

int main() {
    Waimai;
    solve();
}