import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const numCases = readInt();
      foreach (caseId; 0 .. numCases) {
        const N = readLong();
        const I = readLong();
        const J = readLong();
        
        const d = min(I, N - 1 - I, J, N - 1 - J);
        debug {
          writeln("d = ", d);
        }
        
        long ans;
        // \sum_i 4 (N - 1 - 2 i)
        ans += 4 * d * (N - d);
        if (I == d) {
          ans += (J - d);
        } else if (J == N - 1 - d) {
          ans += 1 * (N - 1 - 2 * d);
          ans += (I - d);
        } else if (I == N - 1 - d) {
          ans += 2 * (N - 1 - 2 * d);
          ans += (N - 1 - d - J);
        } else if (J == d) {
          ans += 3 * (N - 1 - 2 * d);
          ans += (N - 1 - d - I);
        } else {
          assert(false);
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}