Description

You are given a set of integers $S = \{L, L+1, \ldots, R\}$. As long as $S$ does not contain $0$, you can repeatedly perform the following operation:

Choose a positive integer $g$ less than or equal to the maximum value in $S$, and replace each element of $S$ with its remainder when divided by $g$.

Determine the maximum number of operations that can be performed.

Input Format

The input consists of multiple test cases.

The first line contains an integer $T$ ($1 \leq T \leq 100\,000$), representing the number of test cases.

$T$ test cases follow. Each test case is given in the following format.

For each test case, the only line contains integers $L$ and $R$ ($1 \leq L \leq R \leq 10^9$), representing the minimum and maximum values of the set, respectively.

Output Format

For the $T$ test cases, output the answers separated by newlines. For each test case, output the maximum number of operations that can be performed.

3
7 10
1 2718
20250913 20250915

2
1
23