#include #define REP(i, n) for(int i = 0; (i) < (n); (i)++) #define INF 5000000000000000 using namespace std; struct Edge{ int to; long weight; Edge(int t, long w) : to(t), weight(w) {} }; long modpow(long a, long n, long mod) { long res = 1; while (n > 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } // a^{-1} mod を計算する long modinv(long a, long mod) { return modpow(a, mod - 2, mod); } struct compare1 { bool operator()(const pair& value, const long& key) { return (value.first < key); } bool operator()(const long& key, const pair& value) { return (key < value.first); } }; struct UnionFind { vector par; vector rank; UnionFind(int n = 1){ init(n); } void init(int n = 1){ par.resize(n); rank.resize(n); REP(i, n) par[i] = i, rank[i] = 0; } int root(int x){ if(par[x] == x) return x; else return par[x] = root(par[x]); } bool issame(int x, int y){ return root(x) == root(y); } bool merge(int x, int y){ x = root(x); y = root(y); if(x == y) return false; if(rank[x] < rank[y]) swap(x, y); if(rank[x] == rank[y]) rank[x]++; par[y] = x; return true; } }; template struct weightedUnionFind{ vector par; vector rank; vector diff_weight; weightedUnionFind(int n = 1, Abel SUM_UNITY = 0){ init(n, SUM_UNITY); } void init(int n = 1, Abel SUM_UNITY = 0){ par.resize(n); rank.resize(n); diff_weight.resize(n); REP(i, n) par[i] = i, rank[i] = 0, diff_weight[i] = SUM_UNITY; } int root(int x){ if(par[x] == x) return x; else{ int r = root(par[x]); diff_weight[x] += diff_weight[par[x]]; return par[x] = r; } } Abel weight(int x){ root(x); return diff_weight[x]; } bool issame(int x, int y){ return root(x) == root(y); } bool merge(int x, int y, Abel w){ w += weight(x); w -= weight(y); x = root(x); y = root(y); if(x == y) return false; if(rank[x] < rank[y]) swap(x, y), w = -w; if(rank[x] == rank[y]) rank[x]++; par[y] = x; diff_weight[y] = w; return true; } Abel diff(int x, int y){ return weight(y) - weight(x); } }; using Graph = vector>; using P = pair; /* void dijkstra(int s, int V, Graph &G, long* d){ priority_queue, greater

> pque; fill(d, d + V, INF); d[s] = 0; pque.push(P(0, s)); while(!pque.empty()){ P p = pque.top(); pque.pop(); int now = p.second; if(d[now] < p.first) continue; REP(i, G[now].size()){ Edge e = G[now][i]; if(d[e.to] > d[now] + e.weight){ d[e.to] = d[now] + e.weight; pque.push(P(d[e.to], e.to)); } } } } */ long GCD(long a, long b){ if(b == 0l) return a; if(a < b) return GCD(b, a); else return GCD(b, a%b); } int main() { int Q; cin >> Q; REP(i, Q){ long N, I, J; cin >> N >> I >> J; if(min(J, N-1-J) > I) cout << 4*I*(N-I)+(N-1-2*I)*3+N-J-I-1 << endl; else if(max(J, N-1-J) < I) cout << 4*(N-I-1)*(I+1)+I+J+3-2*N << endl; else{ if(N%2==0){ if(J<=N/2-1) cout << 4*J*(N-J)*I-J << endl; else cout << 4*(N-1-J)*(J+1)+2*(N-1-J)+J+2-I << endl; }else{ if(J<=(N-3)/2) cout << 4*J*(N-J)*I-J << endl; else if(J>=(N+1)/2) cout << 4*(N-1-J)*(J+1)+2*(N-1-J)+J+2-I << endl; else cout << N*N-1 << endl; } } } return 0; }