q = int(input())
for _ in range(q):
    n, i, j = map(int, input().split())
    k = min([i, n-1-i, j, n-1-j])
    t = 4 * k * (n-k)
    l = n - 1 - 2*k
    
    if i == k:
        print(t + j-k)
    elif j == n-1-k:
        print(t + l + i-k)
    elif i == n-1-k:
        print(t + 2*l + n-1-k-j)
    else:
        print(t + 3*l + n-1-k-i)