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;
using System.Diagnostics;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
using System.Numerics;
using System.IO;
using System.Runtime.InteropServices;
using static System.Math;
using static Math2;
using static io;
using static Utils;

public class ACCEPTED
{
    public void Solve()
    {
        var o = Intm;
        int j = 0;
        for (int i = o[0]; i <= o[1]; ++i)
        {
            if (o[2] % i == 0) j++;
        }
        Write(j);

    }
}

public static class Graph
{

}


public static class Math2
{
    public const int INF = 1 << 29;
    public const long INFL = 1L << 60;
    public const int MOD = 1000000007;
    public const int MOD2 = 998244353;

    public static long Pow(long i, long N, long MOD = 1000000007)
    {
        long res = 1;
        while (N > 0)
        {
            if ((N & 1) != 0) res = res * i % MOD;
            i = i * i % MOD;
            N >>= 1;
        }
        return res;
    }
    public static long GCD(long i, long N)
    {
        while (N != 0)
        {
            var r = i % N;
            i = N;
            N = r;
        }
        return i;
    }
    public static long LCM(long i, long N) => i * N / GCD(i, N);
    public static long Comb(long N, long R, int MOD = 1000000007)
    {
        long ret = 1;
        long x = 1;
        for (long i = N; i >= N - R + 1; --i)
        {
            ret = ret / x * i;
            ret %= MOD;
            x++;
        }
        return ret;
    }
    public static long Comb2(long N, long R)
    {
        long Nume = 1;
        long Deno = 1;

        if (R > N - R) Swap(ref N, ref R);
        for (long i = 1; i <= R; ++i)
        {
            Deno *= i;
            Nume *= N - i + 1;
        }
        return Deno / Nume;
    }
    public static Dictionary<long, int> PrimeFactorization(long N)
    {
        var ret = new Dictionary<long, int>();
        for (long i = 2; i * i <= N; ++i)
        {
            int cnt = 0;
            while (N % i == 0)
            {
                cnt++;
                N /= i;
            }
            if (cnt != 0) ret[i] = cnt;
        }
        if (N >= 2) ret[N] = 1;
        return ret;
    }
    public static List<long> DivisorEnumrate(long N)
    {
        var ret = new List<long>();
        for (long i = 1; i * i <= N; ++i)
        {
            if (N % i == 0)
            {
                ret.Add(i);
                ret.Add(N / i);
            }
        }
        return ret;
    }
}
public static class Utils
{
    public static void Swap<T>(ref T A, ref T B)
    {
        T x = A;
        A = B;
        B = x;
    }
    public static int DigitSum(int N)
    {
        string s = N.ToString();
        int ret = 0;
        for (int i = 0; i < s.Length; ++i) ret += s[i] - '0';
        return ret;
    }
}
class Program
{
    static void Main(string[] args)
    {
        var ACCEPTED = new ACCEPTED();
        ACCEPTED.Solve();
    }
}
public static class io
{
    public static string Str => Console.ReadLine();
    public static string[] Strm => Str.Split(' ');
    public static long[] Longm => Strm.Select(long.Parse).ToArray();
    public static int[] Intm => Strm.Select(int.Parse).ToArray();
    public static char[] Charm => Str.ToArray();
    public static double[] Doublem => Strm.Select(double.Parse).ToArray();
    public static long Long1 => Longm[0];
    public static int Int1 => Intm[0];
    public static char Char1 => Charm[0];
    public static double Double1 => Doublem[0];
    public static long[] HorizontalRead(int N) { long[] A = new long[N]; for (int i = 0; i < N; ++i) A[i] = Long1; return A; }
    public static void Write(string a) => Console.WriteLine(a);
    public static void Write(params object[] i) => Write(string.Join(" ", i));
    public static void Write<T>(IEnumerable<T> a) => Write(string.Join(" ", a));
    public static void Horizontalwrite<T>(IEnumerable<T> a) { foreach (var z in a) Write(z); }
    public static void YN(bool i) { if (i) Write("Yes"); else Write("No"); }
}