Problem:
How Many Divisors?

Write a program which reads three integers a, b and c, and prints the number of divisors of c between a and b.

Input

Three integers a, b and c are given in a line separated by a single space.

Output

Print the number of divisors in a line.

Constraints

1 ≤ a, b, c ≤ 10000

a ≤ b

Sample Input 1

5 14 80

Sample Output 1

3

Solution in Scala (judge verdict: Accepted)

object Main {
    def divisors(n: Int) =
        (1 to math.sqrt(n).toInt).flatMap(m =>
            if (n % m == 0 && m * m == n) List(m)
            else if (n % m == 0) List(m, n / m)
            else Nil
        )
    def main(args: Array[String]) = {
        val in = io.StdIn.readLine.split(" ").map(_.toInt)
        println((in(0) to in(1)).count(divisors(in(2)).contains))
    }
}