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

#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
const int N = 2e6 + 10;
const int mod = 1e9 + 7;

ll solve(ll n, ll m, ll x1, ll x2 ) {
    return (max(0ll,abs(x1 - x2)-1) + max(0ll,(n - 2))+1) / 2;

}
int main() {
    int t;
    cin >> t;
    while(t--) {
        ll n, m, x1, x2;
        cin >> n >> m >> x1 >> x2;
        ll nd = solve(n, m, x1, x2);
        nd = min(min(x1 - 1, m - x2), min(n - 1, nd));
        cout << nd*nd << endl;
    }
}