#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) FOR(i, 0, (n))
#define FOR(i, a, b) for(int i=(a); i<(b); i++)
#define LAR(a, b) ((a)=max((a),(b)))
#define SML(a, b) ((a)=min((a),(b)))
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;
template<typename T>
using pque = priority_queue<T, vector<T>, greater<T>>;
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define ALL(a) (a).begin(), (a).end()
#ifdef LOCAL_DEBUG
#define DEBUG(...) printf(__VA_ARGS__)
#else
#define DEBUG(...)
#endif

int main(){
	int tq; scanf("%d", &tq);
	REP(iq, tq){
		ll n, y, x; scanf("%lld%lld%lld", &n, &y, &x);
		ll a = min({y, n-1-y, x, n-1-x});
		ll b = n-2*a-1, c = n-1-a;
		ll ans = 4*(n-1)*a - 4*a*(a-1);
		if(y == a) {
			ans += b * 0 + x-a;
		} else if(x == c){
			ans += b * 1 + y-a;
		} else if(y == c){
			ans += b * 2 + c-x;
		} else {
			ans += b * 3 + c-y;
		}
		printf("%lld\n", ans);
	}
}