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 JavaScript (judge verdict: Accepted)


process.stdin.resume();
process.stdin.setEncoding('utf8');

process.stdin.on('data', function (chunk) {
    const n = chunk.toString();
    const [a,b,c] = n.split(' ').map(x=>Number(x));
        console.log(yakusu(a,b,c).length);
});

function yakusu(a,b,c){
    var result = [];
    for(var i=a; i<=b; i++) {
        if( (c%i == 0) ) {
            result.push(i);
        }  
    }
    return result;
}