Problem Description

Alice and Bob live in a square house of size \( l \times l \). Recently, Bob has become addicted to the internet, so Alice decides to limit his internet usage.

Alice has set up \( n \) wireless signal blockers, with the \( i \)-th blocker located at \( (x_i, y_i) \) and having a blocking range of \( \frac{l}{n} \).

Unable to resist his urge to go online, Bob seeks your help to find a position \( (x, y) \) where he can access the internet without being blocked by Alice's wireless signal blockers.

Input Format

The first line contains two integers \( n, l \) \( (1 \leq n \leq 10, 1 \leq l \leq 10^5) \), representing the number of wireless signal blockers and the size of the house, respectively.

The next \( n \) lines each contain two numbers \( x_i, y_i \) \( (0 \leq x_i, y_i \leq l) \), describing the positions of the blockers.

Output Format

If a suitable position can be found, output two numbers \( x, y \) \( (0 \leq x, y \leq l) \). If there are multiple solutions, any one of them is acceptable. Your solution is considered correct if the distance to any blocker is at least \( \frac{l}{n} + 10^{-6} \).

Otherwise, output "GG".

Sample Input and Output

Sample Input #1

1 1
0.000 0.000

Sample Output #1

0.999 0.999

Sample Input #2

1 2
1.000 1.000

Sample Output #2

GG

Sample Input #3

2 2
0.000 0.000
2.000 2.000

Sample Output #3

1.000 1.000

见题面 Input 部分

见题面 Output 部分