#include<cstdio>
#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<random>
#include<chrono>
typedef long long ll;
typedef unsigned un;
typedef std::vector<int> P;
typedef std::pair<int,int> pii;
ll read(){ll x=0,f=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=x*10+(c-'0'),c=getchar();return f*x;}
ll max(ll a,ll b){return a>b?a:b;}
ll min(ll a,ll b){return a<b?a:b;}
template <typename T> bool umax(T& a,T t){if(t>a)return a=t,1;return 0;}
template <typename T> bool umin(T& a,T t){if(t<a)return a=t,1;return 0;}
/**********/
int main()
{
    int task=read();
    while(task--)
    {
        ll n=read(),m=read(),x1=read(),x2=read();
        if(n==1){puts("0");continue;}
        ll ans=min(n-1,min(x1-1,m-x2));
        if(x1==x2)umin(ans,(abs(x1-x2)+n-1)>>1);
        //printf("dist=%lld\n",abs(x1-x2)+n-1);
        else umin(ans,(abs(x1-x2)+n-1-1)>>1);
        printf("%lld\n",ans*ans);
    }
    return 0;
}