#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;

typedef long long ll;

int main() {
    int Q;
    cin >> Q;
    rep(q, Q) {
        ll N, I, J, ans;
        cin >> N >> I >> J;
        if (I < N / 2) {
            if (J < N / 2) {
                ll a = min(I, J);
                // sum (4(N-2a+1))
                ans = 4 * N * a - 4 * a * (a + 1) + 4 * a;
                if (I > a) ans += a - I + 4 * (N - 1 - a - a);
                else ans += J - a;
            } else {
                ll a = min(I, N - 1 - J);
                ans = 4 * N * a - 4 * a * (a + 1) + 4 * a + N - a - a - 1;
                if (I > a) ans += I - a;
                else ans -= N - 1 - J - a;
            }
        } else {
            if (J < N / 2) {
                ll a = min(N - 1 - I, J);
                ans = 4 * N * a - 4 * a * (a + 1) + 4 * a + (N - a - a - 1) * 3;
                if (N - 1 - I > a) ans += N - 1 - I - a;
                else ans -= J - a;
            } else {
                ll a = min(N - 1 - I, N - 1 - J);
                ans = 4 * N * a - 4 * a * (a + 1) + 4 * a + (N - a - a - 1) * 2;
                if (N - 1 - I > a) ans -= N - 1 - I - a;
                else ans += N - 1 - J - a;
            }
        }
        cout << ans << "\n";
    }
}