#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

inline ll f(ll n,ll k){
    ll ret=4*(n*k-k*(k+1)+k);
    return ret;
}

void solve(){
    ll n,ni,nj;cin>>n>>ni>>nj;

    ll k=min({ni,nj,n-1-ni,n-1-nj});
    ll ans=f(n,k);
    ll l=n-2*k-1;

    ll pi=k,pj=k;
    if(pi==ni){
        ans+=nj-pj;
        cout<<ans<<endl;
        return ;
    }


    pj+=l;
    ans+=l;
    if(nj==pj){
        ans+=ni-pi;
        cout<<ans<<endl;
        return ;
    }


    pi+=l;ans+=l;
    if(ni==pi){
        ans+=pj-nj;
        cout<<ans<<endl;
        return ;
    }

    pj-=l;
    ans+=l;


    ans+=ni-pi;
    cout<<ans<<endl;
    return ;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int q;cin>>q;
    while(q--) solve();
    return 0;
}