import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

Q = int(readline())


def solve(N, x, y):
    k = min(x, y, N - 1 - x, N - 1 - y)
    # まず k 周してしまう
    x -= k
    y -= k
    step = N ** 2 - (N - k - k) ** 2
    N -= k + k
    if x == 0:
        return step + y
    if y == N - 1:
        return step + (N - 1) + x
    if x == N - 1:
        return step + (N - 1) + (N - 1) + (N - 1 - y)
    if y == 0:
        return step + 3 * (N - 1) + (N - 1 - x)


for _ in range(Q):
    N, x, y = map(int, readline().split())
    print(solve(N, x, y))