For instance, 1236 is a kumba number. Note that 0 cannot be factorized.
Given ℓ and r, can you compute how many kumba numbers belong to [ℓ, r]?
Input
Input consists of several cases, each with ℓ and r. Assume 1 ≤ ℓ ≤ r ≤ 1012.
Output
For every case, print the number of kumba numbers in [ℓ, r].
Input
1236 1236 23 42 1000 1000000 1 1000000000000
Output
1 3 26067 3075841596