/*

Author: Haze

2024/5/23

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll readL() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

inline int read() {
    return (int) (readL());
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

void rot_back(ll &x, ll &y, int tim) {
    while (tim--) {
        swap(x, y);
        y *= -1;
    }
}

void solve() {
    ll n = read(), m = read(), r = read();
    vector<array<ll, 2>> a(n), vec(m);
    irep(i, 0, n - 1) {
        ll x = read(), y = read();
        a[i] = {x, y};
    }
    irep(i, 0, m - 1) {
        ll x = read(), y = read();
        vec[i] = {x, y};
        if(x == 0 and y == 0){
            cout << "Impossible";
            return;
        }
    }
    ll find_ans = 0, ansx = 0, ansy = 0;
    function<void(int)> work = [&](int tim) -> void {
        auto [dx, dy] = vec[0];
//        cerr << dx << " " << dy << endl;

        vector<array<ll, 2>> may;
        may.reserve(n);
        for (auto [x, y]: a) {
            may.push_back({x - dx, y - dy});

        }
        vector<array<ll, 2>> key;

        for (auto [x, y]: may) {
            vector<array<ll, 2>> t;
            for (auto [p, q]: a) {
                ll z = p - x, w = q - y;
                if (abs(z) + abs(w) <= r) {
                    t.push_back({z, w});
                }
                if (t.size() > vec.size())break;
            }
            if (t.size() > vec.size())continue;

            sort(t.begin(), t.end());

            if (t == vec) {
                key.push_back({x, y});
            }
        }


        if (key.size() + find_ans >= 2) {
            cout << "Ambiguous";
            exit(0);
        }
        if (key.size()) {
            find_ans = 1;
            auto [x, y] = key[0];
            rot_back(x, y, tim);
            ansx = x, ansy = y;
        }

//        cerr << endl;
//        cerr << endl;
    };
    sort(vec.begin(), vec.end());
    work(0);
    for (auto &[x, y]: a) {
        swap(x, y);
        x *= -1;
    }

    work(1);

    for (auto &[x, y]: a) {
        swap(x, y);
        x *= -1;
    }

    work(2);


    for (auto &[x, y]: a) {
        swap(x, y);
        x *= -1;
    }

    work(3);
    if (find_ans == 0) {
        cout << "Impossible";
    } else {
        cout << ansx << ' ' << ansy;
    }
}

int main() {
    // IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}