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.Collections;
//using System.Collections.Generic;
using System.Linq;

namespace problem
{
  class Test
  {
    static void Main()
    {
        var a = Console.ReadLine().Split().Select(int.Parse).ToArray();
        int count = 0;
        for (int i = a[0]; i <= a[1]; i++)
        {
            if (a[2] % i == 0) count++;
        } 
        Console.WriteLine(count);
    }
  }
}