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 extends App {
  val sc = new java.util.Scanner(System.in)
  val a, b, c = sc.nextInt()
  val divisors = getDivisorList(c,1)
  val range = (a to b).toList
  println(range.intersect(divisors).size)

  def getDivisorList(target: Int, start: Int): List[Int] = {
    if (target == start)
      List(target)
    else if (target % start == 0)
      start :: getDivisorList(target, start + 1)
    else
      getDivisorList(target, start + 1)
  }
}