You are going to toast some slices of bread for an upcoming party. You have a frying pan that can hold at most toasts at the same time. Toasting one side of a toast takes minutes.
Assume that placing a toast on the pan, flipping it, and removing it are instantaneous operations.
Write a program that determines the minimum number of minutes required to toast slices of bread, if each toast must be toasted on both sides. A toast cannot be removed from the pan before or after the exact minutes needed to toast one side.
Two integers and (0 \le n \le 1000, 1 \le k \le 50) — the number of toasts and the capacity of the pan (in toasts).
Print the minimum number of minutes required to toast all slices.
Example 1