#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;


int n, m, r;
vector<PII> a, b;
const int INF = 1e7;

PII check(int x, int y)
{
	vector<PII> c;
	c.reserve(m + 1);
	FOR (i, 0, n)
	{
		if (abs(x - a[i].F) + abs(y - a[i].S) <= r)
		{
			c.PB({a[i].F - x, a[i].S - y});
			if (SZ(c) > m)
				return {INF, INF};
		}
	}
	if (c == b)
		return {x, y};
	return {INF, INF};
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n >> m >> r;
	a.resize(n);
	b.resize(m);
	FOR (i, 0, n)
		cin >> a[i].F >> a[i].S;
	FOR (i, 0, m)
	{
		cin >> b[i].F >> b[i].S;
		
		if(b[i] == MP(0, 0))
		{
			cout << "Impossible\n";
			return 0;
		}
	}
	int x = INF, y = INF;
	sort(ALL(b));
	FOR (t, 0, 4)
	{
		sort(ALL(a));
		FOR (i, 0, n)
		{
			int X = a[i].F - b[0].F;
			int Y = a[i].S - b[0].S;
			//cerr << X << ' ' << Y << '\n';
			auto res = check(X, Y);
			if (res.F == INF)
				continue;
			if (x != INF)
			{
				cout << "Ambiguous\n";
				return 0;
			}
			x = res.F, y = res.S;
			FOR (j, 0, t)
			{
				int x2 = y;
				int y2 = -x;
				x = x2;
				y = y2;
			}
		}
		FOR (i, 0, n)
			a[i] = {-a[i].S, a[i].F};
	}
	
	if (x == INF)
		cout << "Impossible\n";
	else
		cout << x << ' ' << y << '\n';
	
	return 0;
}