rl = lambda:tuple(map(int, input().split()))
nt,ns,rmax=rl()
f = set(rl() for _ in range(nt))
v = set(rl() for _ in range(ns))
def p(v):
    if (0, 0) in v:
        return []
    possibles=[]
    for i,j in v:
        break
    for (k, l) in f:
        works=True
        for (m,n) in v:
            if (m+k-i, n+l-j) not in f:
                works=False
                break
        if works:
            possibles.append((k,l))
    newPossibles=[]
    for m,n in possibles:            
        works=True
        for k, l in f:
            (tx,ty)=(k-m+i,l-n+j)
            if abs(tx)+abs(ty)<=rmax:
                if (tx,ty) not in v:
                    works=False
                    break
        if works:
            newPossibles.append((m,n))
            if len(newPossibles)>1:
                return newPossibles
    return [(x-i,y-j) for (x,y) in newPossibles]
possibles=[]
for _ in range(4):
    possibles.extend(p(v))
    if len(possibles)>1:
        break
    v={(-y,x) for (x,y) in v}
if len(possibles)>1:
    print('Ambiguous')
elif len(possibles)==0:
    print('Impossible')
else:
    print(*possibles[0])