#include <bits/stdc++.h>
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)p[i].first
#define SP << " " <<
#define fish signed
using namespace std;
mt19937 rnd(1209);
const int INF = 0x3f3f3f3f;
const int N = 5e3 + 10;
pair<int, int> p[N], dp[N];
fish main()
{
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n, m, r; cin >> n >> m >> r;
    for(int i = 1; i <= n; i ++) cin >> p[i].first >> p[i].second;
    for(int i = 1; i <= m; i ++) cin >> dp[i].first >> dp[i].second;
    sort(p + 1, p + n + 1);
    int resx = INF, resy = INF;
    for(int o = 0; o < 4; o ++)
    {
        sort(dp + 1, dp + m + 1);
        for(int i = 1; i <= n; i ++)
        {
            int px = p[i].first - dp[1].first, py = p[i].second - dp[1].second;
            // cerr << px SP py << "\n";
            int cnt = 0;
            for(int j = 1; j <= n; j ++)
            {
                if(p[j].first == px && p[j].second == py) {cnt = INF; break;}
                if(abs(p[j].first - px) + abs(p[j].second - py) <= r)
                {
                    if(cnt >= m) {cnt = INF; break;}
                    cnt ++;
                    // cerr << abs(p[j].first - px) + abs(p[j].second - py) SP i SP p[j].first SP p[j].second SP dp[cnt].first SP dp[cnt].second << "\n";
                    if(make_pair(px + dp[cnt].first, py + dp[cnt].second) != p[j]) {cnt = INF; break;}
                }
            }
            // cerr << "!!\n";
            // if(px == 0 && py == 1) cerr << cnt << "!!!\n";
            if(cnt != m) continue;
            if(resx != INF) {cout << "Ambiguous\n"; return 0;}
            else resx = px, resy = py;
        }
        for(int i = 1; i <= m; i ++) swap(dp[i].first, dp[i].second), dp[i].first *= -1;
    }
    if(resx == INF) {cout << "Impossible\n"; return 0;}
    else cout << resx SP resy << "\n";
    return 0;
}