Q = int(input())
for _ in range(Q):
    N,i,j = map(int,input().split())
    k = min(i,j,N-1-i,N-1-j)
    nk = N-2*k
    Tk = 4*k*(N-k)
    if i==k:
        print(Tk+j-k)
    elif i==N-1-k:
        Tx = Tk+2*(nk-1)
        print(Tx+i-j)
    elif j==N-1-k:
        Tx = Tk+nk-1
        print(Tx+i-k)
    elif j==k:
        Tx = Tk+3*(nk-1)
        print(Tx+N-1-k-i)