20222번 - Jam-packed 다국어

The fruit harvest has been good this year, which means that your jam-selling company, which produces the price-winning Berry Artisanal and Pure Compote, is shipping out jam left and right! A customer has recently placed a huge order of $n$ jars of jam. To ship these jars, you put them into boxes, each of which can hold up to $k$ jars. 

As is always the case with fragile goods, the jars might break in the process of being delivered. You want to avoid the jars bouncing around in their boxes too much, as that significantly increases the chance that they break. To circumvent this, you want to avoid having boxes that are too empty: that would inevitably result in the uncontrolled bouncing around, and subsequently breaking, of the jars. In particular, you want the box with the least number of jars to be as full as possible. In order to estimate the risk you are taking with your precious jars, you would like to know: how many jars does this box contain? 

The input consists of:

• A line with two integers $n$ ($1\leq n\leq 10^{18}$), the number of jars that need to be packed, and $k$ ($1 \leq k \leq 10^{18}$), the number of jars a single box can hold.

Output the number of jars that the least filled box contains.