Q = int(input())

for _ in range(Q):
    n, i, j = map(int, input().split())
    k = min(i, j, n - 1 - i, n - 1 - j)
    s = n ** 2 - (n - k * 2) ** 2
    if k == i:
        print(s + j - k)
    elif k == n - 1 - j:
        print(s + (n - k * 2) * 1 - 1 + i - k)
    elif k == n - 1 - i:
        print(s + (n - k * 2) * 2 - 2 - j + n - k - 1)
    else:
        print(s + (n - k * 2) * 3 - 3 - i + n - k - 1)