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)

def isDivisor?(val, divNum)
  if val % divNum != 0 then
    return false
  end
  return true

end

a, b, c = gets().chomp.split.map(&:to_i)
con = 0

for i in a..b do
  if isDivisor?(c, i) then
    con += 1
  end
end

puts con