Lightbulbs

아직 제출이 없습니다시간 제한1초메모리 제한256 MB

문제

Thomas Edison is actively working on a better version of a lightbulb. During that process, he covers entire fields with batches of lightbulbs and conducts tests on them. In his current experiment, he arranged NN rows with MM lightbulbs in each row. Each lightbulb has a chance PP of working, otherwise, it’s faulty and won’t light up. Thomas wants to find the expected value of the length of the longest horizontal sequence of lightbulbs that are working.

For example, in the setup below, where 11 is a working lightbulb and 00 is faulty, the length of the longest horizontal sequence of lightbulbs that are working is 33, since there are three consecutive ones in the second row (and also in the fourth row).

1 0 1 1
0 1 1 1
0 1 0 0
1 1 1 0
1 1 0 1

Note that we’re interested in horizontal sequences only.

입력

You’re given three numbers separated by spaces – positive integers NN and MM, and a real number PP.

출력

Output the answer to the problem. Your answer would be considered correct if its absolute or relative error is less than 10410^{-4}.

제한

  • 1N,M20001 ≤ N, M ≤ 2000
  • 0P10 ≤ P ≤ 1