#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int Q;
    cin >> Q;
    while(Q--) {
        ll N, y, x;
        cin >> N >> y >> x;
        ll res = 0;
        ll d = INF;
        d = min(y, min(x, min(N - 1 - x, N - 1 - y)));

        res += N * N - (N - 2 * d) * (N - 2 * d);
        N -= 2 * d;
        y -= d;
        x -= d;

        if(y == 0) {
            res += x;
        } else if(x == N - 1) {
            res += N - 1 + y;
        } else if(y == N - 1) {
            res += 2 * N - 2 + (N - 1 - x);
        } else {
            res += 3 * N - 3 + (N - 1 - y);
        }
        cout << res << endl;
    }
}