#P6459. Machining Disc Rotors

    ID: 5326 远端评测题 10000ms 256MiB 尝试: 0 已通过: 0 难度: (无) 上传者: 标签>The 43rd ACM International Collegiate Programming Contest Asia Shenyang Regional Contest

Machining Disc Rotors

Problem Description

Edward is a worker for Aluminum Cyclic Machinery.
His work is to control the mechanical arms to cut out some parts of the mould material.
Here is a brief introduction to his work.

Suppose the operation panel for him is a Euclidean plane with the coordinate system.
Originally the mould is a disc whose centre coordinates is $(0, 0)$ and of radius $R$.
Edward controls $n$ different mechanical arms to cut out and erase those all of the mould within their affected areas.
The affected area of the $i$-th mechanical arm is a circle whose centre coordinate is $(x_i, y_i)$ and of radius $r_i$.
In order to obtain the highly developed product, it is guaranteed that the affected areas of any two mechanical arms share no intersection and no one has an affected area containing the whole original mould.

Your task is to determine the diameter of the residual mould.
Here the diameter of a subset, which may not be convex, over the Euclidean plane is the supremum (i.e. the least upper bound) of distances between every two points in the subset.
Here is an illustration of the sample.

Input

The input contains several test cases, and the first line contains a positive integer $T$ indicating the number of test cases which is up to $5000$.

For each test case, the first line contains two integers $n$ and $R$, where $1 \le n \le 100$ and $1 \le R \le 1000$.

The following $n$ lines describe all mechanical arms controlled by Edward, the $i$-th of which contains three integers $x_i, y_i$ and $r_i$ describing the affected area of the $i$-th mechanical arm, where $-1000 \le x_i, y_i \le 1000$ and $1 \le r_i \le 1000$.

Output

For each test case, output a line containing "Case #x: y"(without quotes), where x is the test case number starting from $1$, and y is the diameter of the remaining area with an absolute or relative error of at most $10^{-9}$.
Precisely speaking, assume that your answer is $a$ and and the jury's answer is $b$, your answer will be considered correct if $\frac{|a - b|}{\max\{1, |b|\}} \le 10^{-9}$, where $\max\{x, y\}$ means the maximum of $x$ and $y$ and $|x|$ means the absolute value of $x$.

1 3 10 0 12 10 11 -6 10 -11 -6 10
Case #1: 18.611654895000252

Hint


In the sample case, the diameter of the remaining area is (324+162*471^0.5/157)^0.5≈18.611654895000253, which is equal to the distance between (-8,6) and (112-27*471^0.5/157,-3-99*471^0.5/314).