#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    int q;
    cin >> q;
    while(q--){
        ll n, y, x;
        cin >> n >> y >> x;
        ll area = min(min(y, n-1-y), min(x, n-1-x));
        ll ans = 4*area*(n-area);
        if(y == area) cout << ans+x-area << "\n";
        else if(n-1-x == area) cout << ans+(n-2*area-1)+(y-area) << "\n";
        else if(n-1-y == area) cout << ans+2*(n-2*area-1)+(n-area-1-x) << "\n";
        else cout << ans+3*(n-2*area-1)+(n-area-1-y) << "\n";
    }
    return 0;
}