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)

input = gets.chomp.split(' ').map(&:to_i)
divisor = []
(input[0]..input[1]).each do |int|
    divisor << int if input[2] % int == 0
end
puts divisor.count