For given n, l and r find the number of distinct geometrical progression, each of which contains n distinct integers not less than l and not greater than r. In other words, for each progression the following must hold: l≤a_i≤r and a_i≠a_j , where a₁,a₂,...,a_n is the geometrical progression, 1≤i,j≤n and i≠j.

Geometrical progression is a sequence of numbers a₁,a₂,...,a_n where each term after first is found by multiplying the previous one by a fixed non-zero number d called the common ratio. Note that in our task d may be non-integer. For example in progression 4,6,9, common ratio is .

Two progressions a₁,a₂,...,a_n and b₁,b₂,...,b_n are considered different, if there is such i (1≤i≤n) that a_i≠b_i.

The first and the only line cotains three integers n, l and r (1≤n≤10⁷,1≤l≤r≤10⁷).

Print the integer K− is the answer to the problem.