#include <bits/stdc++.h>
using namespace std;
int n, m, X1, X2;
void solve() {
    scanf("%d %d %d %d", &n, &m, &X1, &X2);
    int t = n - 1;
    if (X1 == X2) t = min(t, (n - 1) / 2);
    if (X1 != X2) t = min(t, ((n - 1) + abs(X2 - X1) - 1) / 2);
    t = min(t, X1 - 1);
    t = min(t, m - X2);
    t = min(t, (n - 1) + (m - X1));
    t = min(t, (n - 1) + (X2 - 1));
    t = max(t, 0);
    printf("%lld\n", 1ll * t * t);
}
int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
        solve();
    }
    return 0;
}