Count the divisors of every value in the range [L, U] (both L and U included) and return the biggest divisor count you can find.

입력 형식

The first line will contain an integer C with the number of ranges to process. The next C lines will contain a pair of integers L, U.</p>

You have to count the divisors for each number in the range and output the biggest count.

Constraints

• 1 <= C <= 10
• L <= U
• 1 <= L, U <= 10000000
• 0 <= U - L <= 1000
   

For each range a line containing the biggest divisor count found.

예제 입력

5
1 10
1000 1000
9999900 10000000
35 999
25 25

예제 출력

4
16
256
32
3