Minimum Number of Boxes

Version: Phuoc Hung OJ Extended

Problem Statement

A warehouse has $N$ products to pack into identical boxes. Each box can hold at most $K$ products. All products must be packed, and the last box may be partially filled. Determine the minimum number of boxes required.

Input

One line contains two positive integers $N$ and $K$.

Output

Print the minimum number of boxes required.

Subtasks

• Subtask 1 (30 points):
  • $1 \le N \le 10^6$.
  • $1 \le K \le 10^6$.
• Subtask 2 (70 points):
  • $1 \le N \le 10^{18}$.
  • $1 \le K \le 10^{18}$.

Examples

Example 1

Input

17 5

Output

4

Explanation

Three boxes hold at most $15$ products; $2$ products remain, so a fourth box is needed.

Example 2

Input

24 6

Output

4

Explanation

$24$ is divisible by $6$, so exactly four full boxes are sufficient.

Example 3

Input

1000000000000 3

Output

333333333334

Explanation

After $333333333333$ boxes, $999999999999$ products are packed and one remains, so one more box is needed.