Hexagon Coin Toss is a simple game played on a Hexagon chessboard. Players toss a coin on the chessboard and see how many hexagons intersect with the coin. Now you are given a task to calculate the result of the coin toss----for each different number of intersecting hexagons, just output the probability.

To simplify the problem, we assume that the side length of each hexagon is 1 and the radius of the coin will not exceed 0.5 (so that the coin can cover at most 3 hexagons).

The chessboard contains several rows of hexagons and numbers of hexagons in all odd-number-row are the same (That is true for all even-number-rows). The chessboard is described as (N, M, K). Here N representing the number of hexagons in the longest row. M representing the number of rows and K shows the number of hexagons in the first row. So the chessboard above can be represented as (4, 3, 3).

The center of the coin will be in the chessboard and we do not take anything outside the chessboard into consideration. In the situation below, the coin covers 2 hexagons.

The input contains multiple test cases.
The first line of each case contains three integers N, M, K, representing the size of the chessboard. N and M will be in the range of [1，1000] and K equals either N or N-1. It is guaranteed that all input information is valid (So that (2, 1, 1) will not appear).
The following line is a real number R, the radius of the coin.
Input is ended with a case of N=M=K=0.

For each test case, output the case number first.
The following 3 lines are the result information, as shown in the sample output. The result should be rounded to 0.001.
Print an empty line after each test case.