#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define rep(i,x,y) for(register int i=x;i<=y;i++)
#define rep1(i,x,y) for(register int i=x;i>=y;--i)
#define int long long
#define fire signed
#define il inline
#define x first
#define y second
typedef pair<int,int> pii;
const int bufsize = 230005;
char buf[bufsize], *f1, *f2;
#define getchar() (f1 == f2 && (f2 = buf + fread(f1 = buf, 1, bufsize, stdin)) == buf? EOF: *f1++)
template<class T> il void in(T &x) {
    x = 0; char ch = getchar();
    int f = 1;
    while (ch < '0' || ch > '9') {if(ch=='-') f = -1; ch = getchar(); }
    while (ch >= '0' && ch <= '9') { x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar(); }
    x *= f;
}
const int ba=1331;
unordered_set<int> s;
int getid(const pair<int,int>&A){
	return (A.x)*ba+A.y;
}
pair<int,int> operator+(const pair<int,int> &A,const pair<int,int> &B){
	return make_pair(A.first+B.first,A.second+B.second);	
}
pair<int,int> operator-(const pair<int,int> &A,const pair<int,int> &B){
	return make_pair(A.first-B.first,A.second-B.second);	
}
const int N=5e3+10;
int n,m,R,T=1;
pii a[N],b[N];
void solve() {
	in(n),in(m),in(R);
	rep(i,1,n) in(a[i].x),in(a[i].y);
	rep(i,1,m) in(b[i].x),in(b[i].y);
	rep(i,1,n) s.insert(getid(a[i]));
	int cnt=0;
	int ansx=0,ansy=0;
	rep(dir,0,3){
		pii mn=b[1];
		rep(i,1,m) if(b[i].x<mn.x||(b[i].x==mn.y&&b[i].y<mn.y)) mn=b[i];
		rep(i,1,n){
			pii O=a[i]-mn;
			if(s.find(getid(O))!=s.end()) continue;
			bool flag=1;
			rep(j,1,m){
				if(!s.count(getid(O+b[j]))){
					flag=0;
					break;	
				}
			}
			if(!flag) continue;
			int cc=0;
			rep(j,1,n){
				int d=abs(O.x-a[j].x)+abs(O.y-a[j].y);
				if(d<=R) cc++;	
			}
			if(cc!=m) continue;
			cnt++;
			ansx=O.x;
			ansy=O.y;
		}
		rep(i,1,m){
			swap(b[i].x,b[i].y);
			b[i].y=-b[i].y;	
		}
	}
	if (cnt==0) cout<<"Impossible"<<endl;	
	else if (cnt==1) cout<<ansx<<' '<<ansy<<endl;
	else cout<<"Ambiguous"<<endl;
}
fire main(){
	while(T--){
		solve();
	}
	return false;	
}