F. Fortune From Folly
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

Your friend Ómar's favourite video game is Striker-Count. But he has now grown tired of actually playing the game and is more interested in the lootboxes found in the game. This activity amuses Ómar, but does not interest you in the slightest. You are more interested in the numbers: you know that each lootbox Ómar opens has probability $$$p$$$ of containing an item of highest rarity, independently for each lootbox. You want to find the expected number of lootboxes Ómar will open before concluding his process.

Input

The only line of the input contains the two integers $$$n$$$ and $$$k$$$ ($$$1 \le k \le n \le 6$$$), and the real number $$$p$$$ ($$$0 \lt p \le 1$$$ and $$$p$$$ has at most four decimals after the decimal point), with meanings as described above.

Output

Output the expected number of lootboxes Ómar must open, with a relative error of at most $$$10^{-6}$$$. It is guaranteed that the input is such that this expected number does not exceed $$$10^9$$$.

Examples
Input
3 2 0.0026
Output
74445.39143490087
Input
6 1 0.0026
Output
384.61538461538464