All integers from $$$l$$$ to $$$r$$$ inclusive are written on the board, each exactly once.
We call a number on the board beautiful if it is equal to the sum of all numbers on the board, including this number itself. For example, if the numbers $$$-4$$$, $$$-1$$$, $$$2$$$, $$$3$$$, $$$5$$$ are written on the board, then the number $$$5$$$ is beautiful.
You may erase any numbers from the board, but at least one number must remain. Find the minimum number of numbers that need to be erased so that after that there is at least one beautiful number on the board. It is not necessary to erase any numbers if there is already a beautiful number on the board.
The first line contains an integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases.
Each test case consists of one line containing two integers $$$l$$$ and $$$r$$$ ($$$-100 \le l \le r \le 100$$$).
For each test case, print one integer — the minimum number of numbers that need to be erased from the board.
80 02 6-5 -3-2 2-2 3-2 5-6 20 4
04200233
For the test cases from the statement, you should do the following: