import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def tosa(a, n, d):
    return n * (2 * a + (n - 1) * d) // 2

def main():
    Q = int(input())
    NIJ = [[int(x) for x in input().split()] for _ in range(Q)]
    for n, i, j in NIJ:
        k = min(i, n - i - 1, j, n - j - 1)
        c = tosa((n - 1) * 4, k, -8)
        if i == 0 + k:
            print(c + j - k)
        elif j == n - 1 - k:
            print(c + n - 2 * k - 1 + i - k)
        elif i == n - 1 - k:
            print(c + 2 * (n - 2 * k) - 2 + (n - j - 1) - k)
        elif j == 0 + k or j == n - 1 - k:
            print(c + 3 * (n - 2 * k) - 3 + (n - i - 1) - k)

if __name__ == '__main__':
    main()