#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef double db;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<int,ll> pil;
typedef pair<ll,int> pli;
template <typename Type>
using vec=vector<Type>;
template <typename Type>
using grheap=priority_queue<Type>;
template <typename Type>
using lrheap=priority_queue<Type,vector<Type>,greater<Type> >;
#define fir first
#define sec second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define chmax(a,b) a=max(a,b)
#define chmin(a,b) a=min(a,b)
#define rep(i,x,y) for(int i=x;i<=y;i++)
#define per(i,x,y) for(int i=y;i>=x;i--)

const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7/*998244353*/;

const int N=5005,M=1005,R=1005,X=1e5+5;

int n,m,r;
pii dt[N],ds[M];

bool dn,flag;
int ax,ay;

int dis(int x1,int y1,int x2,int y2){
    return abs(x1-x2)+abs(y1-y2);
}

void solve(){
    rep(std,1,n){
        int nx=dt[std].fir-ds[1].fir,ny=dt[std].sec-ds[1].sec;
        int cnt=0;bool pd=false;
        rep(i,1,n){
            if(dt[i].fir==nx&&dt[i].sec==ny){
                pd=true;
                break;
            }
            if(dis(nx,ny,dt[i].fir,dt[i].sec)<=r){
                if(cnt>=m){
                    pd=true;
                    break;
                }
                cnt++;
                if(dt[i].fir!=nx+ds[cnt].fir||dt[i].sec!=ny+ds[cnt].sec){
                    pd=true;
                    break;
                }
            }
        }
        if(cnt<m)pd=true;
        if(pd)continue;
        if(dn){
            cout<<"Ambiguous";
            flag=true;
            return;
        }
        dn=true;
        ax=nx;ay=ny;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>n>>m>>r;
    rep(i,1,n)cin>>dt[i].fir>>dt[i].sec;
    sort(dt+1,dt+1+n);
    rep(i,1,m)cin>>ds[i].fir>>ds[i].sec;
    rep(d,0,3){
        sort(ds+1,ds+1+m);
        solve();
        if(flag)return 0;
        rep(i,1,m){
            swap(ds[i].fir,ds[i].sec);
            ds[i].fir=-ds[i].fir;
        }
    }
    if(!dn)cout<<"Impossible";
    else cout<<ax<<" "<<ay;
    return 0;
}
/*
4 4 100
1 1
2 2
2 1
3 3
0 1
0 2
-1 2
-2 3
*/