import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 9 + 7
EPS = 10 ** -10

for _ in range(INT()):
    N, i, j = MAP()

    turn = min(i, j, N-i-1, N-j-1)
    N2 = N - turn*2
    cost = N**2 - N2**2
    p = (N-turn-1, N-turn-1)
    diff = abs(sum(p) - (i+j))
    if i <= j:
        cost += (N2-1)*2 - diff
    else:
        cost += (N2-1)*2 + diff
    print(cost)