There are (n) monsters, numbered from (1) to (n), in front of Gellyfish. The HP of the (i)-th monster is (h_i). Gellyfish doesn't want to kill them, but she wants to keep these monsters from being a threat to her. So she wants to reduce the HP of all the monsters to exactly (1). Now, Gellyfish, with The Sword Sharpened with Tears, is going to attack the monsters for (m) rounds. For each round: The Sword Sharpened with Tears shines with a probability of (p). Gellyfish can choose whether to attack: If Gellyfish doesn't attack, nothing happens. If Gellyfish chooses to attack and The Sword Sharpened with Tears shines, the HP of all the monsters will be reduced by (1). If Gellyfish chooses to attack and The Sword Sharpened with Tears does not shine, Gellyfish can choose one of the monsters and reduce its HP by (1). If Gellyfish doesn't attack, nothing happens. If Gellyfish chooses to attack and The Sword Sharpened with Tears shines, the HP of all the monsters will be reduced by (1). If Gellyfish chooses to attack and The Sword Sharpened with Tears does not shine, Gellyfish can choose one of the monsters and reduce its HP by (1). Please note that before Gellyfish decides whether or not to attack, she will know whether the sword shines or not. Also, when the sword shines, Gellyfish can only make attacks on all the monsters and cannot make an attack on only one monster. Now, Gellyfish wants to know what the probability is that she will reach her goal if she makes choices optimally during the battle. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 100)). The description of the test cases follows. The first line of each test case contains three integers (n), (m), and (p') ((1 \leq n \leq 20), (1 \leq m \leq 4000), (0 \leq p' \leq 100)) — the number of monsters, the number of rounds of attacks, and an integer representing the prob