#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
const ll INF = 1LL<<60;
typedef pair<ll, ll> P;

int main() {
    cin>>Q;
    rep(_,Q){
        ll i, j;
        cin>>N>>i>>j;
        ll NN = N * N;
        if(!(N&1)){
            N += 1;
            ++j;
            ll ci, cj;
            ci = cj = N / 2;
            i = ci * 2 - i;
            j = cj * 2 - j;
            //cout<<i<<' '<<j<<endl;
        }
        if(N&1){
            ll ci, cj;
            ci = cj = N / 2;
            ll dist = max(abs(i - ci), abs(j - cj));
            if(dist == 0){
                cout<<NN - 1<<endl;
            }else{
                ll ans = (dist*2 - 1) * (dist*2 - 1) - 1;
                if(j + dist == cj){
                    if(i + dist == ci) ans = (dist*2 + 1)*(dist*2 + 1) - 1;
                    else ans += i - (ci - dist);
                }else if(ci + dist == i){
                    ans += dist * 2 + j - (cj - dist);
                }else if(cj + dist == j){
                    ans += dist * 4 + ci + dist - i;
                }else{
                    ans += dist * 6 + cj + dist - j;
                }
                cout<<NN - 1 - ans<<endl;
            }
        }
    }
}