/*
	Luogu name: Symbolize
	Luogu uid: 672793
*/
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define rep1(i,l,r) for(register int i=l;i<=r;++i)
#define rep2(i,l,r) for(register int i=l;i>=r;--i)
#define rep3(i,x,y,z) for(register int i=x[y];~i;i=z[i])
#define rep4(i,x) for(auto i:x)
#define debug() puts("----------")
const int N=1e5+10;
const int inf=0x3f3f3f3f3f3f3f3f;
using namespace std;
int n,m,r,Cnt,ansx,ansy;
bool res;
pii P[N],p[N];
int read()
{
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=(x<<1)+(x<<3)+(ch^48);
		ch=getchar();
	}
	return f*x;
}
int dis(int x1,int y1,int x2,int y2){return abs(x1-x2)+abs(y1-y2);}
void solve()
{
    rep1(k,1,n)
	{
        int nx=p[k].x-P[1].x,ny=p[k].y-P[1].y;
        int cnt=0;
		bool rea=0;
        rep1(i,1,n)
		{
            if(p[i].x==nx&&p[i].y==ny)
			{
                rea=1;
                break;
            }
            if(dis(nx,ny,p[i].x,p[i].y)<=r)
			{
                if(cnt>=m)
				{
                    rea=1;
                    break;
                }
                ++cnt;
                if(p[i].x!=nx+P[cnt].x||p[i].y!=ny+P[cnt].y)
				{
                    rea=1;
                    break;
                }
            }
        }
        if(cnt<m) rea=1;
        if(rea) continue;
        if(Cnt)
		{
            puts("Ambiguous");
            res=1;
            return;
        }
        Cnt=1;
        ansx=nx;
		ansy=ny;
    }
    return;
}
signed main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	n=read();
	m=read();
	r=read();
    rep1(i,1,n)	p[i].x=read(),p[i].y=read();
    sort(p+1,p+1+n);
    rep1(i,1,m) P[i].x=read(),P[i].y=read();
    rep1(kkk,0,3)
	{
        sort(P+1,P+1+m);
        solve();
        if(res) return 0;
        rep1(i,1,m)
		{
            swap(P[i].x,P[i].y);
            P[i].x=-P[i].x;
        }
    }
    if(!Cnt) puts("Impossible");
    else cout<<ansx<<' '<<ansy<<"\n";
	return 0;
}