#include <bits/stdc++.h>
using namespace std;

#include  <ext/pb_ds/assoc_container.hpp>
#include  <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#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--)

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;


int solve()
{
	int n, m, r;
	if (!(cin >> n >> m >> r))
		return 1;
	
	vector<pii> tr(n), de(m);
	FOR (i, 0, n)
		cin >> tr[i].x >> tr[i].y;
	FOR (i, 0, m)
		cin >> de[i].x >> de[i].y;
	
	sort(all(tr));
	sort(all(de));
	tr.erase(unique(all(tr)), tr.end());
	de.erase(unique(all(de)), de.end());
	m = sz(de);
	int x0 = de[0].x, y0 = de[0].y;
	
	array<int, 3> ans{-1, -1, -1};
	auto check = [&](int px, int py, int d) -> bool
	{
		//cerr << "x = " << px << " y = " << py << '\n';
		auto it = lower_bound(all(tr), pii{px, py});
		if (it != tr.end() && *it == pii{px, py})
			return false;
		int cnt = 0;
		for (const pii& tree: tr)
		{
			int x = tree.x, y = tree.y;
			if (abs(x - px) + abs(y - py) > r)
				continue;
			
			x -= px;
			y -= py;
			int cx, cy;
			if (d == 0)
			{
				cx = x;
				cy = y;
			}
			else if (d == 1)
			{
				cx = -x;
				cy = -y;
			}
			else if (d == 2)
			{
				cx = -y;
				cy = x;
			}
			else
			{
				cx = y;
				cy = -x;
			}
			
			pii pos = {cx, cy};
			auto it = lower_bound(all(de), pos);
			if (it == de.end() || *it != pos)
				return false;
			cnt++;
		}
		return cnt == m;
	};
	
	for (const pii& tree: tr)
	{
		int x = tree.x, y = tree.y;
		FOR (d, 0, 4)
		{
			int cx, cy;
			if (d == 0)
			{
				cx = x - x0;
				cy = y - y0;
			}
			else if (d == 1)
			{
				cx = x + x0;
				cy = y + y0;
			}
			else if (d == 2)
			{
				cx = x - y0;
				cy = y + x0;
			}
			else
			{
				cx = x + y0;
				cy = y - x0;
			}
			//cerr << "x = " << cx << " y = " << cy << '\n';
			if (check(cx, cy, d))
			{
				array<int, 3> cur{cx, cy, d};
				if (ans != array<int, 3>{-1, -1, -1} && ans != cur)
				{
					cout << "Ambiguous\n";
					return 0;
				}
				ans = cur;
			}
		}
	}
	if (ans == array<int, 3>{-1, -1, -1})
		cout << "Impossible\n";
	else
		cout << ans[0] << ' ' << ans[1] << '\n';
	
	return 0;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int TET = 1e9;
	//cin >> TET;
	for (int i = 1; i <= TET; i++)
	{
		if (solve())
		{
			break;
		}
		#ifdef ONPC
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}