#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,1,0,-1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;

int main(){
	ll q; cin >> q;
	while(q--){
		ll n,h,w; cin >> n >> h >> w;
		if(n & 1){
			ll mx = max(abs(h-n/2),abs(w-n/2));
			ll f = (2*mx+1) * (2*mx+1);
			f = n*n - f;
			if(h==n/2-mx) cout << f + w - (n/2 - mx) << endl;
			else if(h==n/2+mx) cout << f + 3 * (2*mx) - (w - (n/2 - mx)) << endl;
			else if(w==n/2-mx) cout << f + 4 * (2*mx) - (h - (n/2 - mx)) << endl;
			else cout << f + 2*mx + h - (n/2 - mx) << endl;
		}else{
			ll mx = max(min(abs(h-n/2),abs(h-(n-1)/2)),min(abs(w-n/2),abs(w-(n-1)/2)));
			ll f = (2*mx+2) * (2*mx+2);
			f = n*n - f;
			if(n/2-h==mx+1) cout << f + w - (n/2 - mx - 1) << endl;
			else if(h-n/2==mx) cout << f + 3*(2*mx+1) - (w - (n/2 - mx - 1)) << endl;
			else if(n/2-w==mx+1) cout << f + 4*(2*mx+1) - (h - (n/2 - mx - 1)) << endl;
			else cout << f + (2*mx+1) + h - (n/2 - mx - 1) << endl;
		}
	}
}