You go to bed early on Friday the $$$13^{th}$$$ because you are feeling kind of eepy, only to wake up in the middle of the night to a loud sound. You look around and find yourself in an creepy, abandoned mansion. Beside you is an old map of the mansion. The map indicates $$$n$$$ mysterious points scattered throughout the mansion. Each point is represented by a pair of coordinates $$$(x_i, y_i)$$$, and you are currently standing at a point $$$(x_0, y_0)$$$.
You decide to investigate the point on the map closest to your current location (by Euclidean distance), hoping to find some kind of exit.
The first line contains $$$n$$$, the number of points on the map $$$(1 \leq n \leq 10^5)$$$.
The second line contains two integers, $$$x_0$$$ and $$$y_0$$$, representing your current coordinates $$$(0 \leq x_0, y_0 \leq 10^6)$$$.
Each of the next $$$N$$$ lines contains two integers, $$$x_i$$$ and $$$y_i$$$, representing the coordinates of the $$$i^{th}$$$ point $$$(0 \leq x_i, y_i \leq 10^6)$$$.
It is guaranteed that all points, including your current coordinates, are pairwise distinct.
Print two space-separated integers, $$$x_i$$$ $$$y_i$$$, the coordinates of the point $$$(x_i, y_i)$$$ that is closest to your current location $$$(x_0, y_0)$$$. If there are multiple points at the same minimum distance, output the point with the smallest x-coordinate. If there is still a tie, output the point with the smallest y-coordinate.
42 31 15 210 104 5
1 1
25 01 07 0
7 0
25 07 03 0
3 0
20 01 11000000 1000000
1 1
In the first sample test case, you are currently standing at point (2,3).
The distance from each point to your location is as follows:
(1, 1): $$$\sqrt{(2-1)^2 + (3-1)^2} = 2.24$$$
(5, 2): $$$\sqrt{(2-5)^2 + (3-2)^2} = 3.16$$$
(10, 10): $$$\sqrt{(2-10)^2 + (3-10)^2} = 10.63$$$
(4, 5): $$$\sqrt{(2-4)^2 + (3-5)^2} = 2.83$$$
Thus, the point on the map that is closest to you is (1, 1) because it has the smallest Euclidean distance.
| Name |
|---|


