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;

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

			//??\??????
			string[] abc = Console.ReadLine().Split(' ');

			//??´??° a
			int a = int.Parse (abc[0]);
			//??´??° b
			int b = int.Parse (abc[1]);
			//??´??° c
			int c = int.Parse (abc[2]);

			for(int i = a; i <= b; i++){

				//?????????0?????£??????
				if((c % i) == 0){
					cnt++;
				}
			}
			Console.WriteLine(cnt);
		}
	}
}