Park task

Where doIn In

Where does P need to be in order to minimize the distance from I to J?