def compute_sum(N, k):
    if k == 0:
        return 0
    sum_part1 = 0
    max_i_part1 = (N - 2) // 2
    a = min(k - 1, max_i_part1)
    if a >= 0:
        sum_part1 = 4 * a * (N - a)
    
    sum_part2 = 0
    if N % 2 == 1:
        m = (N - 1) // 2
        if k > m:
            sum_part2 = 1
    
    return sum_part1 + sum_part2

def get_time(N, I, J):
    k = min(I, J, (N-1 - I), (N-1 - J))
    L = N - 2 * k
    if L == 1:
        sum_total = compute_sum(N, k)
        return sum_total
    
    sum_total = compute_sum(N, k)
    i, j = I, J
    right = (i == k) and (k <= j < (k + L))
    if right:
        offset = j - k
        return sum_total + offset
    
    down = (j == (k + L -1)) and ( (k +1) <= i < (k + L))
    if down:
        offset = L + (i - (k +1))
        return sum_total + offset
    
    left = (i == (k + L -1)) and (k <= j <= (k + L -2))
    if left:
        offset = L + (L -1) + ( (k + L -2) - j )
        return sum_total + offset
    
    up = (j == k) and ( (k +1) <= i <= (k + L -2))
    offset = L + (L-1) + (L-1) + (i - (k +1))
    return sum_total + offset

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