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

int n, m, x1, x2;

ll solve()
{
    int ans = n - 1;
    ans = min(ans, x1 - 1);
    ans = min(ans, m - x2);
    if (x1 == x2)
        ans = min(ans, (n - 1) / 2);
    else
    {
        int d = n - 1 + abs(x2 - x1);
        ans = min(ans, (d - 1) / 2);
    }
    return 1ll * ans * ans;
}

int main()
{
    int T;
    scanf("%d", &T);
    while (T--)
    {
        scanf("%d%d%d%d", &n, &m, &x1, &x2);
        printf("%lld\n", solve());
    }
    return 0;
}