#include<bits/stdc++.h>
#define x first
#define y second
#define pii pair<int, int>
using namespace std;
typedef long long LL;
const int MAXN = 5005;

int nt, ns, rmax, ans;
pii p[MAXN], q[MAXN], a[MAXN], ansp;

void solve() {
    scanf("%d %d %d", &nt, &ns, &rmax);
    for (int i = 1; i <= nt; ++i) {
        scanf("%d %d", &p[i].x, &p[i].y);
    }
    for (int i = 1; i <= ns; ++i) {
        scanf("%d %d", &q[i].x, &q[i].y);
    }
    sort(q + 1, q + ns + 1);
    for (int k = 0; k < 4; ++k) {
        for (int i = 1; i <= nt; ++i) { //enumerate which tree correspond to the first sense
            pii o;
            if (k == 0) {
                o = make_pair(p[i].x - q[1].x, p[i].y - q[1].y);
            } else if (k == 1) {
                o = make_pair(p[i].x - q[1].y, p[i].y + q[1].x);
            } else if (k == 2) {
                o = make_pair(p[i].x + q[1].x, p[i].y + q[1].y);
            } else if (k == 3) {
                o = make_pair(p[i].x + q[1].y, p[i].y - q[1].x);
            }
            int tot = 0, flag = 1;
            for (int j = 1; j <= nt; ++j) {
                int dx = p[j].x - o.x, dy = p[j].y - o.y;
                if (dx == 0 && dy == 0) {
                    flag = 0;
                    break;
                }
                if (abs(dx) + abs(dy) > rmax) continue;
                if (k == 1) {
                    swap(dx, dy); dx = -dx;
                } else if (k == 2) {
                    dx = -dx; dy = -dy;
                } else if (k == 3) {
                    swap(dx, dy); dy = -dy;
                }
                a[++tot] = make_pair(dx, dy);
            }
            if (!flag || tot != ns) {
                continue;
            }
            sort(a + 1, a + tot + 1);
            for (int j = 1; j <= ns; ++j) {
                if (q[j] != a[j]) {
                    flag = 0;
                    break;
                }
            }
            if (flag) {
                if (++ans >= 2) {
                    puts("Ambiguous");
                    return;
                }
                ansp = o;
            }
        }
    }
    if (ans) {
        printf("%d %d\n", ansp.x, ansp.y);
    } else {
        puts("Impossible");
    }
}

int main() {
    solve();
    return 0;
}