#include <iostream>
#include <algorithm>

int main() {
    int Q;
    std::cin >> Q;

    for (int i = 0; i < Q; i++) {
        long long N, I, J;
        std::cin >> N >> I >> J;

        long long k = std::min(std::min(I, J), N - 1 - std::max(I, J));
        long long l = N * N - (N - k * 2) * (N - k * 2);
        long long m = N - k * 2 == 1 ? 1 : (N - k * 2 - 1) * 4;

        if (I <= J)
            std::cout << l + I - k + J - k << "\n";
        else
            std::cout << l + m - (I - k + J - k) << "\n";
    }
}