Welcome to ZOJ
Information
Select Problem
Runs
Ranklist
ZOJ Problem Set - 3622
Magic Number

Time Limit: 2 Seconds      Memory Limit: 32768 KB

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

Author: QU, Zhe
Contest: ZOJ Monthly, July 2012
Submit    Status