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 ITP1_3_D_How_Many_Divisors
{
    class Program
    {
        static void Main(string[] args)
        {
            var input = Console.ReadLine().Split( ' ' ).Select( int.Parse ).ToArray();
            Console.WriteLine( Enumerable.Range( input[ 0 ], input[ 1 ] - input[ 0 ] + 1 ).Count( n => input[ 2 ] % n == 0 ) );
        }
    }
}