Football#4383
On a football field with dimensions x \times y, there are football players. These players are currently stationary, waiting to see where the ball will land so they can run to it. A player will run to the ball if it lands closer to them than to any other player.
Your task is to determine the boundaries of the zone for each player, within which they will run to the ball. This zone forms a polygon.
The first line of the input contains three integers: , , and (2 \leq x, y \leq 10^5, 1 \leq n \leq 1000). The following lines each contain two integers representing the coordinates of a player: x_i, y_i (0 < x_i < x, 0 < y_i < y). No two players share the same coordinates.
Output lines. Each line should start with the number of vertices k_i of the zone, followed by k_i pairs of numbers representing the coordinates of the vertices x_{ij}, y_{ij}, listed in counterclockwise order. Begin with the vertex that is the lowest and leftmost in the zone. Output the coordinates as real numbers with maximum precision.
Example 1