#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int q; cin >> q;
  while (q--) {
    int n, i, j; cin >> n >> i >> j;
    int pi = max(min(i, n - 1 - i), min(j, n - 1 - j));
    ll ans = 4LL * pi * (n - pi);
    if (i == pi) {
      cout << ans + (j - pi) << '\n';
    } else if (j == n - 1 - pi) {
      cout << ans + n - pi * 2 - 1 + j - pi << '\n';
    } else if (i == n - 1 - pi) {
      cout << ans + 2LL * (n - pi * 2 - 1) + j - (n - pi - 1) << '\n';
    } else {
      cout << ans + 3LL * (n - pi * 2 - 1) + i - (n - pi - 1) << '\n';
    }
  }
  return 0;
}