#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;

using ll = long long ; 
// cs int D = 1e5; 

int n, m, r;
unordered_map <ll, int> mp; 

using pi = pair <int, int> ; 

vector <pi> p; 

void rot(vector <pi> & c) {
    for(auto & [x, y] : c) {
        int nx = y, ny = -x; 
        x = nx, y = ny; 
    }
}
ll id(int x, int y) {
    return 1ll * x * 1e9 + y; 
}
vector <pi> ans; 
void work(vector <pi> & c) {
    for(auto [x, y] : p) {
        int dx = x - c[0].first, dy = y - c[0].second, flag = 1; 
        for(auto [zx, zy] : c) {
            if(mp.count(id(zx + dx, zy + dy)) == 0) {
                flag = 0;
                break; 
            }
        }
        if(flag && mp.count(id(dx, dy)) == 0) {
            int cc = 0; 
            for(auto [xx, yy] : p) {
                if(abs(xx - dx) + abs(yy - dy) <= r)
                    ++ cc; 
            }
            if(cc == m) ans.pb({dx, dy});
        }
    }
}
int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    ios :: sync_with_stdio(0), cin.tie(0);  
    cin >> n >> m >> r; 
    for(int i = 1; i <= n; i++) {
        ll x, y;
        cin >> x >> y; 
        mp[id(x, y)] = 1;    
        p.pb({x, y});
    }
    vector <pi> c; 
    unordered_map <ll, int> cc; 
    for(int i = 1; i <= m; i++) {
        int x, y; 
        cin >> x >> y; 
        if(cc.count(id(x, y))) {
            cout << "Impossible\n";
            return 0; 
        }
        cc[id(x, y)] = 1; 
        c.pb({x, y});
    }
    work(c);
    rot(c);
    work(c);
    rot(c);
    work(c);
    rot(c);
    work(c);
    if(ans.size() > 1) {
        cout << "Ambiguous\n";
    }
    if(ans.size() == 1) {
        cout << ans[0].first << ' ' << ans[0].second << '\n';
    }
    if(ans.size() == 0){
        cout << "Impossible\n";
    }
    return 0; 
}