from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

T = inp()
for _ in range(T):
    A,B,C = inpl()
    if max(A,B,C) <= 2 or (A==1 and B<=2) or (B<=2 and C==1):
        ans = -1
    else:
        ans = INF
        if A == B == C:
            if A >= 3:
                ans = 3
            else:
                ans = -1
        elif A <= B <= C:
            if A > 1:
                ans = min(ans,B-A+1)
            if B > 1:
                ans = min(ans,C-B+1)
        elif A >= B >= C:
            if C > 1:
                ans = min(ans,B-C+1)
            if B > 1:
                ans = min(ans,A-B+1)
        else:
            ans = 0

    if ans == INF:
        print(-1)
    else:
        print(ans)