#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

void solve(ll N, ll y, ll x){
  ll a = x;
  if(a > (N-1)/2) a = N - 1 - a;
  ll b = y;
  if(b > (N-1)/2) b = N - 1 - b;

  ll mn = min(a,b);
  ll mx = N - 1 - mn;
  
  ll left_top = 4 * mn * (N-mn);
  ll next = 4 * (mn+1) * (N-(mn+1));

  ll ret = left_top;
  ll M = (next - left_top)/4;

  if(y == mn && mn <= x && x < mx){
    ret += x - mn;
  }
  else if(x == mx && mn <= y && y < mx){
    ret += M + y - mn;
  }
  else if(y == mx && mn < x && x <= mx){
    ret += 2*M + mx - x;
  }
  else{
    ret += 3*M + mx - y;
  }
  cout << ret << endl;
}


int main(){
  int Q;
  cin >> Q;
  rep(i,Q){
    ll N, I, J;
    cin >> N >> I >> J;
    solve(N, I, J);
  }
  
  return 0;
}