/* -*- coding: utf-8 -*-
 *
 * 1034.cc:  No.1034 テスターのふっぴーさん - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */


ll rings(int n, int k) {
  int m = n - 2 * k;
  return (ll)n * n - (ll)m * m;
}

/* main */

int main() {
  int q;
  scanf("%d", &q);

  while (q--) {
    int n, i, j;
    scanf("%d%d%d", &n, &i, &j);

    ll t = 0;
    if (i <= j) {
      if (i + j <= n - 1) {
	int k = i;
	t = rings(n, k) + (j - k);
      }
      else {
	int k = n - 1 - j;
	t = rings(n, k) + (ll)(n - 1 - 2 * k) + (i - k);
      }
    }
    else {
      if (i + j >= n - 1) {
	int k = n - 1 - i;
	t = rings(n, k) + (ll)(n - 1 - 2 * k) * 2 + (n - 1 - j - k);
      }
      else {
	int k = j;
	t = rings(n, k) + (ll)(n - 1 - 2 * k) * 3 + (n - 1 - i - k);
      }
    }

    printf("%lld\n", t);
  }
  return 0;
}