#include using namespace std; typedef long long ll; templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b #define vl vector #define vii vector> #define vll vector> #define vvi vector> #define vvl vector> #define vvii vector>> #define vvll vector>> #define vst vector #define pii pair #define pll pair #define pb push_back #define all(x) (x).begin(),(x).end() #define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end()) #define fi first #define se second #define mp make_pair #define si(x) int(x.size()) const int mod=998244353,MAX=300005,INF=15<<26; ll f(ll x,ll y){ ll res=0; res+=min(x,y); res+=min(x/2,y); res-=min(x/2,y/2); return res; ll res2=0; for(ll i=1;i<=x;i++){ if(i<=y||(i%2==0&&i<=y+y)) res2++; } assert(res==res2); return res; } ll solve(ll H,ll W,ll a,ll b,ll c,ll d){ ll ans=0; ll al=H*W-1; if(b==d){ swap(H,W); swap(a,b); swap(c,d); } if(a>c){ a=H+1-a; c=H+1-c; } if(b>d){ b=W+1-b; d=W+1-d; } a--;b--;c--;d--; if(a!=c){ ll ONE=0; ONE+=H-1; ONE+=W-1; ONE+=min(a,b); if(a-b==c-d){ ONE+=c-a-1; }else{ ONE+=min(H-1-a,W-1-b); } ONE+=min(a,W-1-b); ONE+=min(H-1-a,b); ans=ONE+(al-1-ONE)*2; }else{ if(a>Q; while(Q--){ int H,W,a,b,c,d;cin>>H>>W>>a>>b>>c>>d; cout<