#include<bits/stdc++.h>
#define file(F) freopen(#F".in","r",stdin),freopen(#F".out","w",stdout)
#define lowbit(x) ((x)&-(x))
#define ALL(x) (x).begin(),(x).end()
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define popc(x) (__builtin_popcountll((x)))
#define abs(x) ((x)>=0?(x):-(x))
using namespace std;
using ll=long long;
using uint=uint32_t;
template<typename T>
inline bool Max(T &x,T y) { return std::less<T>()(x,y)&&(x=y,true); }
template<typename T>
inline bool Min(T &x,T y) { return std::less<T>()(y,x)&&(x=y,true); }
void Solve();
const int N = 5e3+53,M = 2e3+23;
int n,m,rmx;
int x[N],y[N],tx[M],ty[M];
bool vis[M][M];
bool check(int X,int Y) {
   int cnt=0;
   for(int i=1;i<=n;i++) if(abs(x[i]-X)+abs(y[i]-Y)<=rmx) {
      ++cnt;
      if(!vis[rmx+x[i]-X][rmx+y[i]-Y]) return false;
   }
   return cnt==m;
}
signed main() {
#ifndef ONLINE_JUDGE
#endif
   cin.tie(nullptr)->sync_with_stdio(false);
   Solve();
}
void Solve() {
   cin>>n>>m>>rmx;
   for(int i=1;i<=n;i++) cin>>x[i]>>y[i];
   for(int i=1;i<=m;i++) {
      cin>>tx[i]>>ty[i];
      if(!tx[i]&&!ty[i]) return void(puts("Impossible"));
   }
   bool ok=false; int ansx,ansy;
   for(int k=0;k<4;k++) {
      for(int i=1;i<=m;i++) vis[rmx+tx[i]][rmx+ty[i]]=true;
      for(int i=1;i<=n;i++) if(check(x[i]-tx[1],y[i]-ty[1])) {
         if(ok) return void(puts("Ambiguous"));
         ok=true,ansx=x[i]-tx[1],ansy=y[i]-ty[1];
      }
      for(int i=1;i<=m;i++) vis[rmx+tx[i]][rmx+ty[i]]=false;
      for(int i=1;i<=m;i++) swap(tx[i],ty[i]),ty[i]=-ty[i];
   }
   if(!ok) return void(puts("Impossible"));
   printf("%d %d\n",ansx,ansy);
}