#include <iostream>
#include <algorithm>
using namespace std;
 
int main()
{
    int q, n, i, j;
    cin >> q;
    while (q--) {
        long long ans = 0;
        cin >> n >> i >> j;
        int dep = min(i - 0, min(j - 0, min(n-1-i, n-1-j))) + 1;
        int q = (n-1)* 4, nowl = n - (dep-1) * 2;
        for (int i = 1; i < dep; ++i) ans += q, q -= 2*4; 
        if (i == dep - 1) ans += j - (dep-1);
        else if (j == dep - 1) ans += q - (i - (dep-1));
        else if (i == dep-1 + nowl-1) ans += q  - (nowl-1) - (j - (dep-1));
        else if (j == dep-1 + nowl-1) ans += nowl-1 + (i - (dep-1));

        cout << ans << endl;
    }

    return 0;
}