Grasshopper

A grasshopper wants to get across to the other side of a road. Its first jump can have length $s$, but because it grows tired, every jump after that can be at most half the length of the previous one (the jump length is rounded down to an integer). The grasshopper can, however, always make a jump of length $1$ without tiring.

Given the width of the road, find the minimum number of jumps the grasshopper must make to reach the other side.

The first and only line of standard input contains two integers $x$ and $s$ ($1 \le x, s \le 10^9$), denoting the width of the road and the grasshopper's first jump length, respectively.

Print a single integer on the first line of standard output: the minimum number of jumps the grasshopper needs to reach the other side of the road.