Magic Number

Time Limit: Java: 2000 ms / Others: 2000 ms

Memory Limit: Java: 32768 KB / Others: 32768 KB

Description

A positive number y is called magic number if for every positive integer x it satisfies that put y to the right of x, which will form a new integer z, z mod y = 0.

Input

The input has multiple cases, each case contains two positve integers m, n(1 <= m <= n <= 2^31-1), proceed to the end of file.

Output

For each case, output the total number of magic numbers between m and n(m, n inclusively).

Sample Input

1 1
1 10

Sample Output

1
4

Hint

None

Source

ZOJ Monthly, July 2012

提交代码