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

using System;

public class Test
{
	public static void Main()
	{
		// your code goes here
		string[] s = Console.ReadLine().Split(' ');
		int[] n = new int[s.Length];
		for(int i = 0; i < s.Length; i++) {
			n[i] = int.Parse(s[i]);
		}
		
		var a = n[0];
		var b = n[1];
		var c = n[2];
		
		int num = 0;	//?´???°?????°
		
		for(int i = a; i <= b; i++){
			if( (c % i) == 0 ) num++;
		}
		
		Console.WriteLine(num);
	}
}