You are a friend of someone and some girl. To make the world better, when you walk with someone, you will send a text message to notify some girl where someone goes. This is the reason why someone always cannot meet some girl. You’re tired to do this thing again and again. You decide to set up the sensor network to detect someone. You put many of them in the campus. If someone is near the sensor, the sensor will send to the message to some girl automatically. Unfortunately, because of the problem about the wave, the sensors cannot be too close to each other. You realize this remark from the readme of the sensors after the setup. You remember the positions of the sensors. Try to check whether a pair of the sensors is too close.
Each test case starts with a line containing two integers n(1<=n<=105) and d(1<=n<=107) indicating the number of sensors on the campus and the minimum safe distances between every two sensors. Following this are n lines, each containing 2 integers representing the position of the sensor xi, yi (|xi|,|yi|<=107) .
If there exists a pair of too close sensors, output “Reconstruct”.
Otherwise, output “Go Go Go!!”