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)

'use strict';

var fs = require('fs');
var contents = fs.readFileSync('/dev/stdin', 'utf-8');

var findDivisors = function(contents) {
    var line = contents.trim().split(" ");
    var a = parseInt(line[0]);
    var b = parseInt(line[1]);
    var c = parseInt(line[2]);

    var n = 0;
    for (var i = a; i <= b; i++) {
        if (c % i === 0) {
            n++;
        }
    }
    return n;
}

console.log(findDivisors(contents));