Suppose we have a set of balls and a large cuboid box, with a rectangle as its base. The box has a fixed size at the base, but we can choose its height. We would like to place all the balls within the box, and at the same time try to minimize its height.

 

Input

 

First, 2 integers, 10 = a,b = 100 - the dimensions of the rectangular base of the box. Then, an integer 1 = n = 10000, representing the number of balls. The following n values 1 = r_i = 5 are the radii of the respective balls.

 

Output

 

You should write to output n triples of floating-point numbers, the ith triple being the x,y, and z coordinates of the center of the ith ball.

 

If we want to be precise, the coordinates of the points written to output must fulfill the following constraints for the i-th point:
x_i-r_i = 0,
y_i-r_i = 0,
z_i-r_i = 0,
x_i+r_i = a,
y_i+r_i = b. Moreover, for each i ? j,
(x_i - x_j)² + (y_i - y_j)² +
(z_i - z_j)² = (r_i + r_j)² (no two balls are allowed to overlap).

 

Scoring

 

The goal is to minimize the height h of the box, where h = max_i (z_i+r_i).
For each data set, your program will be scored by the proportion of the box volume actually used by the balls:

 

score = 4/3*p*(r₁³+..+r_n³)/(a*b*h).

 

The program is run independently for a number of data sets, and the displayed score is the mean of scores obtained for individual data sets.

 

Example

Input: 5 5 2 1.0 2.0 Output: 4.0 4.0 3.0 2.0 2.0 2.0 Score: 37.6991118/100.0 = 0.376991118