#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ll mod = 1e9 + 7;
//const ll mod = 998244353;
#define REP(i,n) for(int i=0;i<(int)n;++i)
//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){
os << "(" << v.first << ", " << v.second << ")"; return os;
}
template<class T> ostream& operator << (ostream& os, const vector<T> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os;
}
template<class T> ostream& operator << (ostream& os, const vector<vector<T>> v){
for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os;
}
string num2bit(ll num, ll len){
    string bit = "";
    REP(i, len){
    bit += char('0'+(num>>i & 1));
    }
    return bit;
}

void solve(){
    ll N, I, J;
    cin >> N >> I >> J;

    ll mi = (1ll<<60);
    chmin(mi, I);
    chmin(mi, J);
    chmin(mi, N-1-I);
    chmin(mi, N-1-J);
    //dump(mi)

    ll r = 4*mi*N - 4*mi*(mi-1) -4*mi;

    //dump(r)

    if(I==mi){
        r += J-mi;
    }else if(J==N-1-mi){
        r += (N-2*mi) + (I-mi) -1;
    }else if(I==N-1-mi){
        r += 2*(N-2*mi)-2 + (N-1-mi-J);
    }else{
        r += 3*(N-2*mi)-3 + (N-1-mi-I);
    }
    cout << r << endl;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll Q;
    cin >> Q;
    while(Q--) solve();

    return 0;
}