Divisors#1569

Divisors

1 second
128 megabytes
Very easy

Let be the number of divisors of . Given two integers and (a \leq b), calculate the sum f(a) + f(a + 1) + \ldots + f(b).

Input

Each line contains two integers and (1 \leq a \leq b \leq 2^{31} - 1). The last line contains a = b = 0 and is not processed.

Output

For each test case, print the value of f(a) + f(a + 1) + \ldots + f(b) on a separate line.

Examples

Example 1

Loading
Loading