Overkill

cologne is playing a game called Trimps. The game has $N$ monsters lined up in order. The current health of the $i$-th monster is $A_i$. Dealing $x$ damage to a monster reduces its health by $x$, and if its health drops to $0$ or below, the monster dies. cologne's goal is to kill every monster through battle. A battle consists of several turns, and each turn works as follows. 1. Find the first monster whose health is above $0$ and deal $D$ damage to it. 2. If the damaged monster's health becomes $-h$, which is below $0$, overkill happens. Overkill is handled as follows. If the damaged monster has no next monster, the turn ends. If a next monster exists, deal damage equal to $p$ percent of $h$, rounded down to an integer, to the next monster. How many turns are needed to kill all monsters?

The first line contains the number of monsters $N$, the base damage $D$, and the overkill ratio $p$, separated by spaces. $(1 \le N, D, p \le 100)$ The next $N$ lines contain the health values $A_1, A_2, \cdots, A_N$ of each monster, separated by spaces. $(1 \le A_i \le 100)$ All given numbers are integers.

Print the number of turns needed to kill all monsters.

Overkill happens only once per turn. In other words, one turn cannot deal damage to three or more monsters.