#include <bits/stdc++.h>
using namespace std;

int main(){
    int Q;
    cin >> Q;
    while(Q--){
        int64_t N, I, J;
        cin >> N >> I >> J;
        int u = I, d = (N-1-I), l = J, r = (N-1-J);
        int mn = min({u, d, l, r});
        int64_t in = N-2*mn;
        int64_t base = N*N - in*in;
        int64_t ans = base-1;
        if(u == mn){
            ans += J-mn+1;
        }else{
            ans += in-1;
            if(r == mn){
                ans += I-mn+1;
            }else{
                ans += in-1;
                if(d == mn){
                    ans += N-mn-J;
                }else{
                    ans += in-1;
                    ans += N-mn-I;
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}