What is the optimum way to find the furthest point from a given point in a matrix?

Question

Consider a Matrix of dimension NxM. Given a point P =(x,y) in the matrix, find another point Q = (x1,y1) such that Q is furthest away from P. Solutions in python appreciated