Bob is interested in GCDs (Greatest Common Divisors). Formally, for some positive integers , we denote as the greatest positive integer , such that for each .

Bob has chosen an interval . He is going to choose distinct integers from the interval and compute their GCD. There are many integers that can be the final answer, and Bob is curious in the number of such integers. Please write a program to tell him the answer.

The first and only line of input consists of three integers .

Print a single integer, indicating your answer.

5 9 2

3

For the sample, it is possible to get  as the final GCD, by choosing numbers  and . It turns out that any other integer cannot become the GCD, thus the answer is .