//#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;

#define fi first
#define se second
#define mp make_pair
 
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll INF = 1ll << 60;
const double PI = 2 * asin(1);

void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}

int Q;
ll N, I, J;

int Solve(){
  ll Cand = min(min(I, J), min(N - 1 - I, N - 1 - J));
  ll ans = ((N - 1) + (N - 2 * Cand + 1)) * Cand * 2;

  if (Cand == I){
    ans += J - Cand;
    cout << ans << endl;
  }else if (Cand == N - 1 - J){
    ans += N - Cand * 2 - 1;
    ans += I - Cand;
    cout << ans << endl;
  }else if (Cand == N - 1 - I){
    ans += 2 * (N - Cand * 2 - 1);
    ans += (N - Cand - 1) - J;
    cout << ans << endl;
  }else{
    ans += 3 * (N - Cand * 2 - 1);
    ans += (N - Cand - 1) - I;
    cout << ans << endl;
  }

  return 0;
}

int main(){
  cin >> Q;
  for (int i = 0; i < Q; i++){
    cin >> N >> I >> J;
    Solve();
  }
  return 0;
}