You are given a checkerboard of size $201 \times 201$, i. e. it has $201$ rows and $201$ columns. The rows of this checkerboard are numbered from $-100$ to $100$ from bottom to top. The columns of this checkerboard are numbered from $-100$ to $100$ from left to right. The notation $(r, c)$ denotes the cell located in the $r$-th row and the $c$-th column.

There is a king piece at position $(0, 0)$ and it wants to get to position $(a, b)$ as soon as possible. In this problem our king is lame. Each second, the king makes exactly one of the following five moves.

• Skip move. King's position remains unchanged.
• Go up. If the current position of the king is $(r, c)$ he goes to position $(r + 1, c)$.
• Go down. Position changes from $(r, c)$ to $(r - 1, c)$.
• Go right. Position changes from $(r, c)$ to $(r, c + 1)$.
• Go left. Position changes from $(r, c)$ to $(r, c - 1)$.

What is the minimum number of seconds the lame king needs to reach position $(a, b)$?

The first line of the input contains a single integer $t$ ($1 \leq t \leq 10^4$) — the number of test cases. Then follow $t$ lines containing one test case description each.

Each test case consists of two integers $a$ and $b$ ($-100 \leq a, b \leq 100$) — the position of the cell that the king wants to reach. It is guaranteed that either $a \ne 0$ or $b \ne 0$.

Print $t$ integers. The $i$-th of these integers should be equal to the minimum number of seconds the lame king needs to get to the position he wants to reach in the $i$-th test case. The king always starts at position $(0, 0)$.