Everyone knows the so-called Dirichlet principle, which reads as follows:

Suppose that a certain number of rabbits are planted in the cells. If the number of rabbits more than the number of cells, at least in one cell will be more than one rabbit.

In this problem, we consider the more general case of the classical mathematical fact. Suppose there are n cells and m rabbits, which are seated in these cells. Calculate the maximum number of rabbits that is guaranteed to be in the same cell.

Input

One line contains two positive integers n and m (1 ≤ n, m ≤ 109).

Output

Print the maximum number of rabbits that is guaranteed to be in the same cell.