Rock teaches a class of $N$ students at the School of Imposture. He wants to purchase $K$ pieces of candy to bribe his students. For fairness, the $K$ pieces of candy should be equally distributed among the students with no leftovers.

Due to budgeting reasons, Rock can only purchase at least $A$ and at most $B$ candies. Count the number of unique ways Rock can purchase $K$ pieces of candies for his students.

Input

The only line of input contains 3 integers: $N$, $A$ and $B$.

Output

Output the required answer on a single line.

Constraints

Subtask 1 (40%): $1 \le N \le 10^6, 1 \le A \le B \le 10^6$
Subtask 2 (60%): $1 \le N \le 10^{18}, 1 \le A \le B \le 10^{18}$