#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int q; cin>>q;
	while(q--){
		ll n, x, y;
		cin>>n>>x>>y;
		ll d=min({x, n-1-x, y, n-1-y});
		x-=d, y-=d;
		ll ans=4*(n-1)*d-2*d*(d-1);
		if(x==0) ans+=y;
		else if(x==n-1-2*d) ans+=3*(n-1-2*d)-y;
		else if(y==0) ans+=4*(n-1-2*d)-x;
		else ans+=n-1-2*d+x;
		cout<<ans<<endl;
	}
	return 0;
}