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)

a,b,c = gets.split(" ").map{|x|x.to_i}
count = 0
yakusu = Array.new()
n = 0
for i in 1..c do
	if c % i == 0
		yakusu[n] = i
		n += 1
	end
end
for i in a..b do
	yakusu.size.times do |j|
		count += 1 if yakusu[j] == i
	end
end
puts count