#include <iostream>
#include <queue>
#include <algorithm>
#include <set>

using namespace std; using ll=long long; const int INF=1e2; using P=pair<int,int>;

ll solve(ll n, ll x, ll y) {
  ll x1 = y, y1 = x, x2 = n-1-y, y2 = n-1-x;
  if (x1 == 0 || y1 == 0 || x2 == 0 || y2 == 0) {
    if (y1 == 0) return x1+1;
    else if (x2 == 0) return n + y1;
    else if (y2 == 0) return 2 * n - 2 + (n-x1);
    else if (x1 == 0) return 4 * n - 3 - y1;
  } else {
    ll mn = min({x1,y1,x2,y2});
    ll temp = 4 * (mn * n - mn * (mn + 1) / 2);
    //cout<<"p: "<<temp<<" "<<n-2*mn<<" "<<x1-mn<<" "<<y1-mn<<" "<<mn<<endl;
    return temp + solve(n-2*mn, y1-mn, x1-mn);
  }
}

int main() {
  int q; cin>>q;
  for(int qq=0;qq<q;qq++) {
    ll n,x,y; cin>>n>>x>>y;
    cout<<solve(n,x,y)-1<<endl;
    /*
    ll x2=n-1-x1, y2=n-1-y2, an;
    if (x1 <= x2 && x1 <= y1 && x1 <= y2) {
      an = x1 * n - x1 * (x1 + 1) + (n - )
    } else if (x2 <= x1 && x2 <= y1 && x2 <= y2) {

    } else if (y1 <= x1 && y1 <= x2 && y1 <= y2) {
      
    } else {

    }*/
  }
}