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: Wrong Answer)

using System;

namespace HowManyDivisors
{
	class MainClass
	{
		public static void Main (string[] args)
		{
			int cnt = 0;
			string input = Console.ReadLine();

			char[] CharSeparators = new char[] {' '};
			string[] array = input.Split(CharSeparators);

			string array1 = array[0];
			string array2 = array[1];
			string array3 = array[2];

			int a = int.Parse (array1);
			int b = int.Parse (array2);
			int c = int.Parse (array3);

			for(int i = a; i <= b; i++){
				if((c % i) == 0){
					cnt++;
				}
				Console.WriteLine(cnt);
			}
		}
	}
}