#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

#define pb push_back

const ld pi = 3.14159265358979323846;
const ll INF = 1e18;

template<typename T>
T chmax(T a, T b) {
    return a > b ? a : b;
}

template<typename T>
T chmin(T a, T b) {
    return a > b ? b : a;
}

void solve() {
    int n, m, s;
    cin >> n >> m >> s;

    vector<pair<int, int>> a, b;
    map<pair<int, int>, int> mp, rec;

    for(int i = 0; i < n; i++){
        int x, y;
        cin >> x >> y;

        mp[{x, y}] = 1;
        a.pb({x, y});
    }

    for(int i = 0; i < m; i++){
        int x, y;
        cin >> x >> y;
        b.pb({x, y});
    }

    ll nx = -INF, ny = -INF, qwq = 0;
    for(int dir = 0; dir < 4; dir++){
        for(int i = 0; i < a.size(); i++){
            int x = a[i].first - b[0].first, y = a[i].second - b[0].second;
            rec.clear();
            rec[a[i]] = 1;

            if(mp[{x, y}] == 0){
                for(int j = 1; j < b.size(); j++){
                    int dx = x + b[j].first, dy = y + b[j].second;
                    if(abs(b[j].first) + abs(b[j].second) > s){
                        continue;
                    }
                    if(mp[{dx, dy}] == 1){
                        rec[{dx, dy}] = 1;
                    }
                }

                for(int i = 0; i < n; i++){
                    if(abs(a[i].first - x) + abs(a[i].second - y) <= s && rec[a[i]] == 0){
                        rec.clear();
                        break;
                    }
                }
            }

            if(rec.size() == m){
                nx = x;
                ny = y;
                qwq++;
            }
        }    
        if(qwq > 1){
            break;
        }

        for(auto &p : b){
            p = {-p.second, p.first};
        }
    }

    if(qwq > 1){
        cout << "Ambiguous" << endl;
    }
    else if(qwq == 1){
        cout << nx << " " << ny << endl;
    }
    else{
        cout << "Impossible" << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}