INF = 10 ** 9
MOD = 10 **9 + 7
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from  collections import deque
from math import factorial

def main():
    q = int(input())
    for _ in range(q):
        n,i,j = map(int,input().split())
        d = min(i,j,n - 1 - i,n - 1 - j)
        if d == i:
            if d == 0:
                ans = j
            else:
                ans = j - d + 2*d*(2*n - d - 1)
        elif d == j:
            if d == 0:
                ans = 3*(n - 1) + n - i - 1
            else:
                ans = 2*d*(2*n - d - 1) + 3*(n - 2*d - 1) + n - d - i - 1
        elif d == n - i - 1:
            if d == 0:
                ans = 2*(n - 1) + n - j - 1
            else:
                ans = 2*d*(2*n - d - 1) + 2*(n - 2*d - 1) + n - d - j - 1
        else:
            if d == 0:
                ans = n - 1 + i
            else:
                ans = 2*d*(2*n - d - 1) + (n - 2*d - 1) + i - d
        print(ans)
if __name__=='__main__':
    main()