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 Ruby (judge verdict: Accepted)

# ITP1_3_D: How Many Divisors?

from, to, n = gets.split.map &:to_i

n_divisors = from.upto(to).inject(0) do |n_divisors, d|
  n_divisors + (n % d == 0 ? 1 : 0)
end

p n_divisors