#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll MOD = 998244353LL;
constexpr int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
template <class T>
void chmin(T &a, T b) { a = min(a, b); }
template <class T>
void chmax(T &a, T b) { a = max(a, b); }
void debug() { cerr << "ok" << endl; }
template <class T>
void printv(const vector<T> &v) {
    for (int i = 0; i < v.size(); i++) cout << v[i] << (i + 1 == v.size() ? '\n' : ' ');
}
template <class T>
void readv(vector<T> &v) {
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll t;
    cin >> t;
    while (t--) {
        ll n, i, j;
        cin >> n >> i >> j;
        if (n % 2 > 0 && i == n / 2 && j == n / 2) {
            cout << n * n - 1LL << endl;
            continue;
        }
        ll k = n - 2 * min({i, j, n - 1 - i, n - 1 - j});
        ll res = (4 * n + 4 * k - 8) * ((n - k) / 2LL + 1LL) / 2LL;
        res -= 4 * k - 4;
        ll m = min({i, j, n - 1 - i, n - 1 - j});
        if (m == i) {
            res += j - m;
        } else if (m == n - 1 - j) {
            res += k - 1 + i - m;
        } else if (m == n - 1 - i) {
            res += 2 * (k - 1) + (n - 1 - m) - j;
        } else {
            res += 3 * (k - 1) + (n - 1 - m) - i;
        }
        cout << res << endl;
    }
}