Problem Statement

How many triples $A,B,C$ of integers between $L$ and $R$ (inclusive) satisfy $A-B=C$?

You will be given $T$ cases. Solve each of them.

Constraints

• $1 \leq T \leq 2\times 10^4$
• $0\le L \le R \le 10^6$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

T
\text{case}_1
\vdots
\text{case}_T

Each case is in the following format:

L R

Output

Print $T$ values; the $i$-th of them should be the answer for $\text{case}_i$.