Football 2#4384
On a football field of size x \times y, there are football players. The players are standing still, waiting to see where the ball will land so that they can run towards it. A player will run for the ball if it lands closer to them than to any other player.
Your task is to determine, for each player, the boundaries of the zone within which they would run towards the ball. This zone is a polygon.
The first line contains three integers , , and (2 \leq x, y \leq 10^5, 1 \leq n \leq 30000). Each of the following lines contains two integers x_i and y_i (0 < x_i < x, 0 < y_i < y), the coordinates of the -th player. No two players occupy the same position.
Output lines. Each line should contain the number of vertices k_i of the player's zone, followed by k_i pairs of real numbers, the coordinates x_{ij} y_{ij} of the vertices, listed in counterclockwise order starting from the lowest (smallest ) among those with the smallest coordinate. Output all real numbers with the maximum available precision.
Örnek 1