402375: GYM100739 I Red and yellow

You can have one red circle with radius in the range [A;B] and unlimited number of yellow circles with radius R. Task is to put all circles in a way that each yellow circle touches 2 other yellow circles and 1 red circle. A circle cannot be inside another circle. Calculate how many different real sizes (X) of the red circle radius can satisfy this condition.

A single line contains 3 integers A, B and R. (1 ≤ A, B, R ≤ 10⁷, A ≤ B)

Print a single integer X.

2 2 2

1

1 2 2

2