eolymp
bolt
Try our new interface for solving problems
Problems

Грибной дождь

Грибной дождь

\includegraphics{https://static.e-olymp.com/content/db/dbb88ebe2f02f28f6221a4eab82aa3bc0631477c.jpg} At the edge of the forest grows Friendly Family fungi. Location of each fungus given the coordinates \textbf{X}, \textbf{Y}, and the pileus has a radius \textbf{R}. When the rain, the radius of the cap of each mushroom growing co speed of \textbf{1} centimeter per minute. When the rain ends (and it is not more than \textbf{Т} minutes), the cap cease to grow. If during a rain cap two fungi come into contact, they immediately cease to grow, so as not to hurt each other. Mushrooms are very friendly, so if the two fail to grow the fungus, then all the others too, do not grow. Your task: to count how many cm increased the radius of the cap of each mushroom after the rain. \InputFile The first line contains the number \textbf{N} -- the number of tests. The first line of the test contains two integers: the number of fungis \textbf{K} (\textbf{K} <= \textbf{10}) and duration of rain \textbf{T} (\textbf{T} <= \textbf{100}). By the following lines describe fungi \textbf{X} and \textbf{Y} (\textbf{X} <= \textbf{100}, \textbf{Y} <= \textbf{100}) and the radius of the cap \textbf{R} (\textbf{R} <= \textbf{10}). Coordinates and radius are given in centimeters. \OutputFile For each test display one number - the amount by which to increase the radius of all fungi. The result should not contain insignificant zeros and should be removed up to two decimal places.
Time limit 1 second
Memory limit 64 MiB
Input example #1
2
2 1
0 0 1
2 2 1
3 2
0 0 1
5 5 1
10 10 1
Output example #1
0.41
2.00