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 incLcm(a, b, c)
	cnt = 0
	a.upto(b){|i|
		if (c % i == 0)
			cnt += 1
		end
	}
	return cnt
end

input = gets
a, b, c = input.split(' ').map(&:to_i)

puts incLcm(a, b, c)