#include <bits/stdc++.h>

using namespace std;

using ll = long long;

// 4 * (N - 1) + 4 * (N - 3) + 4 * (N - 4)
// 4 * (N - (k - 1)) * (k)  [ N >= 2 * k ]

ll solve(ll N, ll I, ll J) {
    ll hoge = min({I, N - 1 - I, J, N - 1 - J});
    ll res = 4 * (N - hoge) * hoge;

    if (I == hoge) {
        res += J - hoge;
        return res;
    }

    ll d = (N - hoge * 2);
    res += d - 1;

    if (J == hoge + d - 1) {
        res += I - hoge;
        return res;
    }

    res += d - 1;
    if (I == hoge + d - 1) {
        res += hoge + d - 1 - J;
        return res;
    }

    res += d - 1;
    res += hoge + d - 1 - I;
    return res;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q;
    cin >> q;
    for (int i = 0; i < q; ++i) {
        ll N, I, J;
        cin >> N >> I >> J;
        cout << solve(N, I, J) << "\n";
    }
    return 0;
}