def f(a, d, n): # 初項、交差、項数
    return n*(2*a + (n - 1)*d)//2

Q = int(input())
for i in range(Q):
    N, i, j = map(int, input().split())
    phase = min(i, j, N - 1 - i, N - 1 - j)
    # 0 ~ phase-1 フェーズの個数は？
    ans = 4*f(N - 1, -2, phase)
    # phase 上の N 番目の数
    i -= phase
    j -= phase
    #print(phase, cnt, i, j)
    C = N - 2*phase - 1
    if i == 0 and 0 <= j < C:
        ans += j
    elif j == C and 0 <= i < C:
        ans += C + i
    elif i == C and 0 < j <= C:
        ans += 2*C + (C - j)
    else:
        ans += 3*C + (C - i)
    print(ans)