def solve():
    n,i,j = map(int,input().split())

    dif = min(i,j,n-1-i,n-1-j)
    base = (n-1+n+1-2*dif)*dif*2

    size = n-2*dif
    
    li = dif
    lj = dif

    if i == li:
        base += j-lj
        return base
    base += size-1
    rj = lj+size-1
    if j == rj:
        base += i-li
        return base
    base += size-1

    ri = li+size-1
    if i == ri:
        base += rj-j
        return base
    base += size-1
    base += ri-i
    return base

q = int(input())
for _ in range(q):
    print(solve())