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;
using System.Linq;
 
namespace Aizu
{
    class OnlineJudge
    {
        public static void Main()
        {
            var d = Array.ConvertAll(Console.ReadLine().Split(), int.Parse);
            Console.WriteLine(Enumerable.Range(d[0], d[1] - d[0] + 1).Count(q => d[2] % q == 0));
        }
    }
}