def compute_time(N, I, J):
    k = min(I, J, (N-1)-I, (N-1)-J)
    sum_outer = 4 * k * (N - k)
    L = N - 2 * k
    if L == 0:
        return sum_outer  # This case should not occur for valid I, J
    
    # Check right edge (i == k)
    if I == k and J >= k and J <= (N-1 - k):
        offset = J - k
        return sum_outer + offset
    # Check bottom edge (j == N-1 -k)
    elif J == (N-1 - k) and I >= (k + 1) and I <= (N-1 - k):
        offset = I - (k + 1)
        return sum_outer + L + offset
    # Check left edge (i == N-1 -k)
    elif I == (N-1 - k) and J <= (N-1 - k -1) and J >= k:
        offset = (N-1 - k - 1) - J
        return sum_outer + L + (L - 1) + offset
    # Check top edge (j == k)
    elif J == k and I >= (k + 1) and I <= (N-1 - k -1):
        offset = (N-1 - k - 1) - I
        return sum_outer + L + (L -1) * 2 + offset
    else:
        return -1  # Should not reach here if inputs are valid

Q = int(input())
for _ in range(Q):
    N, I, J = map(int, input().split())
    print(compute_time(N, I, J))