#include <bits/stdc++.h>
using namespace std;
int main(){
  int Q;
  cin >> Q;
  for (int i = 0; i < Q; i++){
    long long N, I, J;
    cin >> N >> I >> J;
    long long T = N * N - 1;
    if (N % 2 == 1){
      I -= (N / 2);
      J -= (N / 2);
    } else {
      I -= (N / 2);
      J -= (N / 2 - 1);
      I = -I;
      J = -J;
    }
    long long M = max(abs(I), abs(J));
    long long B = (2 * M - 1) * (2 * M - 1) - 1;
    long long S = M * 2;
    if (M == 0){
      cout << T << endl;
    } else if (J == -M && I != -M){
      cout << T - (B + I + M) << endl;
    } else if (I == M && J != -M){
      cout << T - (B + S + J + M) << endl;
    } else if (J == M && I != M){
      cout << T - (B + S * 2 + M - I) << endl;
    } else {
      cout << T - (B + S * 3 + M - J) << endl;
    }
  }
}