#include <bits/stdc++.h>
#define re register
#define fst first
#define snd second

using namespace std;

typedef pair<int,int> pii;
const int N = 5010;
const int inf = 1e9 + 10;
int n,m,R,ansx = inf,ansy = inf;
pii arr[N],del[N];
map<pii,bool> vis;

inline int read(){
    int r = 0,w = 1;
    char c = getchar();
    while (c < '0' || c > '9'){
        if (c == '-') w = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9'){
        r = (r << 3) + (r << 1) + (c ^ 48);
        c = getchar();
    }
    return r * w;
}

inline pii get(int x,int y,int w){
    int tx,ty;
    if (!w) tx = x,ty = y;
    else if (w == 1) tx = y,ty = -x;
    else if (w == 2) tx = -x,ty = -y;
    else tx = -y,ty = x;
    return {tx,ty};
}

int main(){
    n = read(),m = read(),R = read();
    for (re int i = 1;i <= n;i++){
        arr[i].fst = read(),arr[i].snd = read();
        vis[{arr[i].fst,arr[i].snd}] = true;
    }
    for (re int i = 1;i <= m;i++){
        del[i].fst = read(),del[i].snd = read();
        if (!del[i].fst && !del[i].snd) return puts("Impossible"),0;
    }
    for (re int i = 1;i <= n;i++){
        for (re int w = 0;w < 4;w++){
            pii tmp = get(del[1].fst,del[1].snd,w);
            int x = arr[i].fst - tmp.fst,y = arr[i].snd - tmp.snd;
            int cnt = 0; bool falg = true;
            for (re int j = 2;j <= m;j++){
                pii tmp = get(del[j].fst,del[j].snd,w);
                int tx = x + tmp.fst,ty = y + tmp.snd;
                if (!vis.count({tx,ty})){
                    falg = false; break;
                }
            }
            for (re int j = 1;j <= n;j++) cnt += (abs(arr[j].fst - x) + abs(arr[j].snd - y) <= R);
            if (falg && cnt == m){
                if (ansx != inf) return puts("Ambiguous"),0;
                else ansx = x,ansy = y;
            }
        }
    }
    if (ansx == inf) puts("Impossible");
    else printf("%d %d",ansx,ansy);
    return 0;
}