OLDP - Old problem
Let G is the convex polygon with area S and perimeter L. We need to know volume of set of points which distance from G is not greater than R.
Number of test cases in first line and three integers S, L and R for each test case. All integers in input are nonnegative and less than 100.
Volume for each test case with 10-2 precision.
Input: 1 48 57 1 Output: 189.724