410088: GYM103940 E Express Warehouse Migration

Jaime's distribution company is getting back to business. In this new distribution task Jaime has to move $$$N$$$ boxes that are stored in his backup warehouse to the main warehouse. In order to do this, Jaime has only one truck, so he will drive to the backup warehouse, then load the truck, and finally drive to the main warehouse and unload the truck, all the previous process is considered a single trip of boxes. Jaime knows if he loads more than $$$M$$$ boxes in the truck it will force the engine and potentially break it, so he will ensure to move the boxes without forcing the engine.

Can you help Jaime determine, how many trips does he has to make in order to move all the boxes from the backup warehouse to the main warehouse?

The first and only line of input contains two integers separated by a space, $$$N$$$ and $$$M$$$ ($$$1 \leq N,M \leq 10^6$$$)

Print a single line with an integer number, the minimum number of trips Jaime has to make to move all the boxes to the warehouse.

10 10

1

1 10

1

11 5

3