spoj#CIRUT. CIRU2

CIRU2

You are given N different circles , while some region may be covered more than once.

If one region is covered by K times, then it was called a "K- Region".

So, you are expected to output the area of all the regions! (K from 1 to N)

 

Input

The first line is one integer n indicates the number of the circles. (1 <= n <= 1000)

Then follows n lines every line has three integers

Xi Yi Ri

indicates the coordinate of the center of the circle, and the radius. (|Xi|. |Yi|  <= 1000, 0 < Ri <= 1000)

 

Output

Output N lines, the i-th line output

[i] = area_of_i_region

here the area must round to  3 digits after decimal point.

 

Example

Input:
3
0 0 1
1 0 1
1 1 1

Output: [1] = 4.699
[2] = 1.699
[3] = 0.443