#include <bits/stdc++.h>
#define REP(i, start, end) for (int64_t i=start, i##Len=(end); i < i##Len; ++i)
#define REPR(i, start, end) for (int64_t i=start, i##Len=(end); i > i##Len; --i)
using ll = int64_t;
using namespace std;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    ll Q, N, I, J;
    cin >> Q;
    REP(i, 0, Q) {
        cin >> N >> I >> J;
        ll nest = min(min(I, N-1-I), min(J, N-1-J));
        ll ans = (2*(N-1) + (nest-1)*(-2)) * nest * 2;
        if (J == nest) ans += I - nest;
        else if (I == N-1-nest) ans += (N-1-2*nest) + (J - nest);
        else if (J == N-1-nest) ans += (N-1-2*nest)*2 + (N-1-nest - I);
        else ans += (N-1-2*nest)*3 + (N-1-nest - J);

        cout << ans << endl;
    }

}