B-Smooth Numbers

Memory limit: 32 MB

Let be a positive integer. A natural number is called -smooth, if in its factorisation into primes there is no prime factor greater then . We may say equivalently that a number is called -smooth, if it may be represented as a product of positive integers less then or equal to .

Task

Write a program which:

• reads from the standard input three positive integers , and ,
• determines the number of all -smooth numbers in the interval (inclusive),
• writes the result to the standard output.

Input

In the first line of the standard input there are three integers , and , separated by single spaces, , , .

Output

Your program should write one integer in the first line of the standard output. It should be the determined number of -smooth numbers.

Example

For the input data:

30 10 5

the correct result is:

4

Task author: Wojciech Guzicki.