We simplify the game OSU to the following problem. Given n and m, there are n clicks. Each click may success or fail. For a continuous success sequence with length X, the player can score X^m. The probability that the i-th click success is p[i]/100. We want to know the expectation of score. As the result might be very large , you only need to output the result mod 1000000007.
Niuniu likes to play OSU! We simplify the game OSU to the following problem. Given n and m, there are n clicks. Each click may success or fail. For a continuous success sequence with length X, the player can score X^m. The probability that the i-th click success is p[i]/100. We want to know the expectation of score. As the result might be very large (and not integral), you only need to output the result mod 1000000007.
（图片来源网络，侵删）
