#include <bits/stdc++.h>
#define dbg(x) cerr << #x << ':' << (x) << endl; 
using namespace std;
using ll = long long;
using ld = long double;
#define ALL(x) x.begin(),x.end()

int main()
{
    int nt, ns, rmax;
    cin >> nt >> ns >> rmax;
    vector<int> tx(nt), ty(nt), dx(ns), dy(ns);
    for (int i = 0; i < nt; ++i) cin >> tx[i] >> ty[i];
    for (int i = 0; i < ns; ++i) cin >> dx[i] >> dy[i];
    int ansx = 1e9, ansy = 1e9;
    for (int _t = 0; _t < 4; ++_t)
    {
        map<pair<int, int>, int> cnt;
        for (int i = 0; i < nt; ++i)
        {
            for (int j = 0; j < ns; ++j)
            {
                int nx = tx[i] - dx[j], ny = ty[i] - dy[j];
                ++cnt[{nx, ny}];
            }
        }
        for (auto [xy, c] : cnt)
        {
            auto [x, y] = xy;
            if (c != ns) continue;
            int sum = 0;
            for (int i = 0; i < nt; ++i)
            {
                int tmp = abs(tx[i] - x) + abs(ty[i] - y);
                sum += (tmp <= rmax);
                if (tx[i] == x && ty[i] == y)
                {
                    sum = ns + 1;
                    break;
                }
            }
            if (sum == ns)
            {
                if (ansx == 1e9)
                {
                    ansx = x;
                    ansy = y;
                }
                else
                {
                    cout << "Ambiguous" << endl;
                    return 0;
                }
            }
        }
        for (int i = 0; i < ns; ++i)
        {
            swap(dx[i], dy[i]);
            dx[i] = -dx[i];
        }
    }
    if (ansx == 1e9) cout << "Impossible" << endl;
    else cout << ansx << ' ' << ansy << endl;
}