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 _3_D
{
    class Program
    {
        static void Main(string[] args)
        {
            var abc = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
            var a = abc[0];
            var b = abc[1];
            var c = abc[2];
            var count = 0;
            for (var i = a; i <= b; i++)
            {
                if (c % i == 0)
                {
                    count++;
                }
            }
            Console.WriteLine(count);
        }
    }
}