//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << 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 (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int q;
    vector<ll> ans1;
    cin>>q;
    while(q--){
        ll n,h,w;
        cin>>n>>h>>w;
        ll mini=min(n-h-1,h);
        chmin(mini,n-w-1);
        chmin(mini,w);
        ll now=4*(n-mini)*mini;
        ll ans;
        if(mini==h){
            ans=now+w-mini;
        }
        else if(mini==w){
            ans=now+(n-mini*2-1)*3+n-mini-h-1;
        }
        else if(mini==n-w-1){
            ans = now + (n - mini*2 - 1) + h - mini;
        }
        else{
            ans = now + (n - mini*2 - 1) * 2 + n - mini - w - 1;
        }
        ans1.push_back(ans);
    }
    rep(i,ans1.size()){
        cout<<ans1[i]<<"\n";
    }
}