Problem:
Design of a Mansion

Our master carpenter is designing a condominium called Bange Hills Mansion. The condominium is constructed by stacking up floors of the same height. The height of each floor is designed so that the total height of the stacked floors coincides with the predetermined height of the condominium. The height of each floor can be adjusted freely with a certain range.

The final outcome of the building depends on clever height allotment for each floor. So, he plans to calculate possible combinations of per-floor heights to check how many options he has.

Given the height of the condominium and the adjustable range of each floor’s height, make a program to enumerate the number of choices for a floor.

Input

The input is given in the following format.

$H$ $A$ $B$

The input line provides the height of the condominium $H$ ($1 \leq H \leq 10^5$) and the upper and lower limits $A$ and $B$ of the height adjustable range for one floor ($1 \leq A \leq B \leq H$). All data are given as integers.

Output

Output the number of possible height selections for each floor in a line.

Sample Input 1

100 2 4

Sample Output 1

2

Sample Input 2

101 3 5

Sample Output 2

0

Solution in Ruby (judge verdict: Accepted)

h, a, b = gets.split.map(&:to_i)
p (a..b).count {|k| h % k == 0 }