#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

int q, i, j, I, J, N;

int main(){
    cin >> q;
    int ans[q];
    for(i = 0; i < q; i++){
        cin >> N >> I >> J;
        int tmp = min(min(I, N - I - 1), min(N - J - 1, J));
        ans[i] = (N * tmp * 4) - ((tmp + 1) * (tmp + 1));
        
        // パターン分ける
        if(I < N - I - 1 && tmp == I){
            ans[i] += J - tmp;
        }else if(I >= N - I - 1 && tmp == N - I - 1){
            ans[i] += (N - tmp * 2 - 1) * 2;
            ans[i] += N - J - 1 - tmp;
        }else if(J <= N - J - 1 and tmp == J){
            ans[i] += N - tmp * 1 - 1;
            ans[i] += I - tmp;
        }else{
            ans[i] += (N - tmp * 1 - 1) * 3;
            ans[i] += N - I - 1 - tmp;
        }
        ans[i] += 1;
    }
    
    for(i = 0; i < q; i++) cout << ans[i] << endl;
        
    return 0;
}