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)

namespace Test
{
    using System;
    using System.Collections.Generic;
    using System.Linq;
    using System.Text;

    public class Test
    {
        public static void Main(string[] args)
        {
            var t = new Test();
            var input = t.ParseIntList(t.ReadInput());
            var a = input[0];
            var b = input[1];
            var c = input[2];
            var count = 0;
            
            Console.WriteLine(t.Calc(a, b, c, count));

        }


        public int Calc(int a, int b, int c, int count)
        {
            if (a == b)
            {
                if (c % a == 0)
                {
                    return ++count;
                }
                else
                {
                    return count;
                }
            }

            if (c % a == 0)
            {
                count++;
            }

            return Calc(++a, b, c, count);
        }

        public int ReadInputOneLine()
        {
            return int.Parse(Console.ReadLine());
        }

        public string[] ReadInput()
        {
            return Console.ReadLine().Split(' ');
        }

        public List<int> ParseIntList(string[] x)
        {
            var convertedList = new List<int>(x.Length);
            for (var i = 0; i < x.Length; i++)
            {
                convertedList.Add(int.Parse(x[i]));
            }

            return convertedList;
        }

}
}