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: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ITP1
{
    class ITP1_3_D
    {
        static void Main(string[] args)
        {
            int a, b, c;
            int divisor_count = 0;

            List<int> dataSet = Console.ReadLine().Split().Select(int.Parse).ToList();

            a = dataSet[0];
            b = dataSet[1];
            c = dataSet[2];

            for (int i = a; i < b; i++)
            {
                if (((c % i) == 0) && (i != c))
                {
                    divisor_count++;
                }
            }

            Console.WriteLine(divisor_count);
            Console.ReadLine();
        }
    }
}