Problem Statement

A Kadomatsu sequence is defined as follows: when 3 integers are arranged as $A$, $B$, $C$ from left to right,
all the values are distinct and the second largest integer among $A$, $B$, $C$ is either $A$ or $C$.
In particular, in this problem, $A$, $B$, $C$ of a Kadomatsu sequence must be positive integers.

3 positive integers $A$, $B$, $C$ are given in this order from the left.
Perform the 3 operations below any number of times to make a Kadomatsu sequence at the minimum cost.

・At cost 1, subtract 1 from the positive integer $A$.
・At cost 1, subtract 1 from the positive integer $B$.
・At cost 1, subtract 1 from the positive integer $C$.

※Note that in this problem, multiple queries are given in one test case.

Input

$T$
$A_1$ $B_1$ $C_1$
$A_2$ $B_2$ $C_2$
$ \vdots\ $
$A_T$ $B_T$ $C_T$

$T$ is the number of given triples of positive integers $A$, $B$, $C$. $1 \le T \le 10000 = 10^4$.
$A_i$, $B_i$, $C_i$ are the $i$-th given positive integers $A$, $B$, $C$. $1 \le A_i,B_i,C_i \le 1000000000 = 10^9$.

Output

On the $i$-th line, output the answer for the $i$-th $A_i$, $B_i$, $C_i$.
If a Kadomatsu sequence cannot be made, output -1.

Sample

1
4 3 2

2

3
1 3 2
1 2 3
3 3 3

0
-1
3