#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
const int inf=1e9+7;
const ll mod=1e9+7;

int main() {
    int Q;
    cin>>Q;
    ll N, I, J;
    vector<ll> ans;
    ll syuu;
    ll tmpans;
    for(int i=0;i<Q;++i){
        cin>>N>>I>>J;
        syuu = min(min(I, J), N-1-min(I, J));
        tmpans = 4*(N*syuu-syuu*(syuu+1)/2);
        if(I==syuu){
            ans.push_back(tmpans + J-syuu);
        }
        else if(J-syuu==N-1-syuu){
            ans.push_back(tmpans + J+I-syuu);
        }
        else if(I-syuu==N-1-syuu){
            ans.push_back(tmpans + J+I+syuu-J);
        }
        else{
            ans.push_back(tmpans + J+I+J+syuu-I);
        }
    }
    for(int i=0;i<Q;++i){
        cout<<ans[i]<<endl;
    }
}