#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
 
typedef pair<ll, ll> pl;
typedef pair<ld,ld> pd;
typedef vector<ll> vl;
// typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
 
#define G(x) ll x; cin >> x;
#define F(i, l, r) for (ll i = l; i < (r); ++i)
#define all(a) begin(a), end(a)
#define K first
#define V second
#define OK(i,j) i >= 0 && i < n && j >= 0 && j < m
 
#define NN 2000005
#define MM 5005
#define MOD 1000000007

void solve() {

    ll nt, ns, rmax;
    cin >> nt >> ns >> rmax;
    vector<pl> trees;
    vector<pl> sensor;
    pl inpt;
    for(ll i=0;i<nt;i++) {
        cin >> inpt.K >> inpt.V;
        trees.push_back(inpt);
    }
    for(ll i=0;i<ns;i++) {
        cin >> inpt.K >> inpt.V;
        sensor.push_back(inpt);
    }

    // pl referenceTree = trees[0];
    // for(ll i=0;i<nt;i++) {
    //     trees[i].K -= referenceTree.K;
    //     trees[i].V -= referenceTree.V;
    // }

    ll valid = 0;
    pl ans = {1e9,1e9};
    sort(sensor.begin(),sensor.end());


    for(ll dir=0;dir<4;dir++) {
        // cout << "DIRECTION " << dir << '\n';
        sort(trees.begin(),trees.end());
        for(ll i=0;i<nt;i++) {

            if(i > 0 && trees[i] == trees[i-1]) continue;
            //place sensor[0] at trees[i]
            //ensure there is no tree at trees[i] - sensor[0]
            pl robotLoc = {trees[i].K-sensor[0].K,trees[i].V-sensor[0].V};
            // cout << "I AM CONSIDERING (" << robotLoc.K << ',' << robotLoc.V << ")\n";
            auto closestTree = lower_bound(trees.begin(),trees.end(),robotLoc);
            if(closestTree != trees.end() && *closestTree == robotLoc) continue;
            // cout << "VALID START LOCATION\n";

            ll j1=0, j2=1;
            bool ok = 1;

            while(j1 < i) {
                if((abs(trees[j1].K - robotLoc.K)) + (abs(trees[j1].V-robotLoc.V)) <= rmax) {
                    ok = 0;
                    // cout << "PRECHECK: FAILED FOR TREE (" << trees[j1].K << ',' << trees[j1].V << ")\n";
                }
                j1++;
            }

            j1++;

            if(!ok) continue;

            while(j1<nt && j2<ns) {
                // is trees[j1] in range?
                if((abs(trees[j1].K - robotLoc.K)) + (abs(trees[j1].V-robotLoc.V)) > rmax) {
                    j1++;
                    continue;
                }

                pl treeLoc = {robotLoc.K + sensor[j2].K,robotLoc.V + sensor[j2].V};
                if(trees[j1] == treeLoc) {
                    j1++;
                    j2++;
                }
                else {
                    ok = 0;
                    break;
                }
            }
            if(j2 < ns) ok = 0;

            while(j1 < nt) {
                if((abs(trees[j1].K - robotLoc.K)) + (abs(trees[j1].V-robotLoc.V)) <= rmax) {
                    ok = 0;
                    // cout << "POSTCHECK: FAILED FOR TREE (" << trees[j1].K << ',' << trees[j1].V << ")\n";
                }
                j1++;
            }

            if(!ok) continue;

            valid++;

            if(dir == 0) ans = robotLoc;
            else if(dir == 1) ans = {robotLoc.V,-robotLoc.K};
            else if(dir == 2) ans = {-robotLoc.K,-robotLoc.V};
            else ans = {-robotLoc.V,robotLoc.K};

            if(valid > 1) break;
        }
        if(valid > 1) break;
        for(ll i=0;i<nt;i++) {
            //rotate grid
            trees[i] = {-trees[i].V,trees[i].K};
        }
    }

    if(valid == 0) cout << "Impossible\n";
    else if(valid == 1) cout << ans.K << ' ' << ans.V << '\n';
    else cout << "Ambiguous\n";

}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(10);

    solve();

    return 0;

}