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 _3_D
{
    class Program
    {
        static void Main(string[] args)
        {
            int w = 0; int[] x = Console.ReadLine().Split().Select(int.Parse).ToArray();
            for (int a = x[0]; a <= x[1]; a++)
            { int q = x[2];
                
                if (q % a == 0)
                {
                    w++;
                }
                else
                {
                   
                }
            }
            Console.WriteLine(w);
        }
    }
}