def kadomastu(a,b,c):
    if b == 2:
        return -1
    elif a == b == c:
        return 3
    elif max(a, b, c) == b:
        if a != c:
            return 0
        else:
            return 1
    else:
        cost = max(a, b, c) - b + 1
        if a != c:
            return cost
        else:
            return cost + 1

n = int(input())
for _ in range(n):
    a, b, c = map(int, input().split())
    print(kadomastu(a,b,c))