#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int N=5005;
int a[N],b[N];
map<pa,int>Mp;
int n,m,R;
pa E[N],G[N];
bool chk(int x,int y)
{
    if (Mp.count(mp(x,y))) return 0;
    Mp[mp(x,y)]=1;
    int tot=0;
    for (int i=1;i<=n;i++)
        if (abs(a[i]-x)+abs(b[i]-y)<=R) 
        {
            if (a[i]==x&&b[i]==y) return 0;
            G[++tot]=mp(a[i]-x,b[i]-y);
        }
    if (tot!=m)
    {
        return 0;
    }
    sort(G+1,G+m+1);
    for (int i=1;i<=m;i++)
        if (G[i]!=E[i]) return 0;
    return 1;
}
void BellaKira()
{
    cin>>n>>m>>R;
    for (int i=1;i<=n;i++)
    {
        cin>>a[i]>>b[i];
    }
    for (int i=1;i<=m;i++)
        cin>>E[i].fi>>E[i].se;
    int ans=0,ansx=0,ansy=0;

    sort(E+1,E+m+1);
    for (int i=1;i<=n;i++)
    {
        if (chk(a[i]-E[1].fi,b[i]-E[1].se))
        {
            if (ans)
            {
                cout<<"Ambiguous\n";
                return;
            }
            ans=1;
            ansx=a[i]-E[1].fi,ansy=b[i]-E[1].se;
        }
    }
    for (int i=1;i<=m;i++)
        swap(E[i].fi,E[i].se),E[i].se=-E[i].se;
    Mp.clear();
        
    sort(E+1,E+m+1);
    for (int i=1;i<=n;i++)
    {
        if (chk(a[i]-E[1].fi,b[i]-E[1].se))
        {
            if (ans)
            {
                cout<<"Ambiguous\n";
                return;
            }
            ans=1;
            ansx=a[i]-E[1].fi,ansy=b[i]-E[1].se;
        }
    }
    for (int i=1;i<=m;i++)
        swap(E[i].fi,E[i].se),E[i].se=-E[i].se;
    Mp.clear();

    sort(E+1,E+m+1);
    for (int i=1;i<=n;i++)
    {
        if (chk(a[i]-E[1].fi,b[i]-E[1].se))
        {
            if (ans)
            {
                cout<<"Ambiguous\n";
                return;
            }
            ans=1;
            ansx=a[i]-E[1].fi,ansy=b[i]-E[1].se;
        }
    }
    for (int i=1;i<=m;i++)
        swap(E[i].fi,E[i].se),E[i].se=-E[i].se;
    Mp.clear();

    sort(E+1,E+m+1);
    for (int i=1;i<=n;i++)
    {
        if (chk(a[i]-E[1].fi,b[i]-E[1].se))
        {
            if (ans)
            {
                cout<<"Ambiguous\n";
                return;
            }
            ans=1;
            ansx=a[i]-E[1].fi,ansy=b[i]-E[1].se;
        }
    }
    for (int i=1;i<=m;i++)
        swap(E[i].fi,E[i].se),E[i].se=-E[i].se;
    Mp.clear();

    if (!ans) cout<<"Impossible\n";
    else
        cout<<ansx<<" "<<ansy<<'\n';
}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/