#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using LL = long long;
using pii = pair<int, int>;
#define sz(x) signed(size(x))
#define F first
#define S second
void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    
    vector<pii> a(n), b(m);
    for (int i = 0; i < n; i++) {
        cin >> a[i].F >> a[i].S;
    }
    bool err = 0;
    for (int i = 0; i < m; i++) {
        cin >> b[i].F >> b[i].S;
        if (b[i].F == 0 && b[i].S == 0) {
            cout << "Impossible\n";
            err = 1;
        }
    }
    if(err) return;
    sort(b.begin(), b.end());
    pii ret = {-1, -1};
    for (int t = 0; t < 4; t++) {
        sort(a.begin(), a.end());
        for (int i = 0; i < n; i++) {
            int x = a[i].F - b[0].F;
            int y = a[i].S - b[0].S;
            pii c;
            {
                vector<pii> res;
                for (int j = 0; j < n; j++) {
                    if (abs(x - a[j].F) + abs(y - a[j].S) <= k) {
                        res.push_back({a[j].F - x, a[j].S - y});
                    }
                }
                if (sz(res) > m || res != b) {
                    c = {1e9, 1e9};
                } else {
                    c = {x, y};
                }
            }
            if (c.F == 1e9) continue;
            if (ret.F != -1) {
                cout << "Ambiguous\n";
                return;
            }
            for (int j = 0; j < t; j++) {
                pii nxt;
                nxt.F = y;
                nxt.S = -x;
                x = nxt.F;
                y = nxt.S;
            }
            ret = {x, y};
        }
        for (int i = 0; i < n; i++) {
            a[i] = {-a[i].S, a[i].F};
        }
    }
    if (ret.F == -1) {
        cout << "Impossible\n";
        return;
    }
    cout << ret.F << " " << ret.S << '\n';
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    while (t--)
        solve();
    return 0;
}