406416: GYM102397 J AbuTahun and Flash Memories

AbuTahun is preparing to ASU Coding Cup 4, and for unknown reasons he want to store all the solutions of the contestants in flash memories.

The contest is over, and there is $$$n$$$ solutions, all the solutions has the same size which is $$$x$$$ GB, and each flash memory could store at most $$$a$$$ GB.

Notice that you can't split one file and store it multiple memory, each file has to be stored in a single memory.

AbuTahun went to Rakan's store to buy some flash memories, can you tell him what is the minimum number of flash memories he has to by to store all the solutions?

The input contains 3 integers $$$n$$$, $$$x$$$, $$$a$$$ $$$(1 \leq n \leq 10^5 )$$$ $$$(1 \leq x \leq a \leq 10^5 )$$$

print the minimum number of flash memories ahmad has to buy.

10 2 7

4

3 5 15

1

In first sample, there is 10 files each of them of size 2GB, and each flash memory could store at most 7GB so it could contains at most 3 files of size 2GB, so AbuTahun needs 4 flash memories to store 10 files of size 2GB.