#include <bits/stdc++.h> using namespace std; #define ll long long #define N 2000013 #define MOD 1000000007 inline ll PowerMod(ll a, ll p, ll mod){ ll ret = 1; while(p > 0){ if(p & 1){ (ret *= a) %= mod; } p >>= 1; (a *= a) %= mod; } return ret; } ll fac[N], ifac[N]; inline void pre(){ int i; fac[0] = 1; for(i = 1; i < N; i++){ fac[i] = (fac[i - 1] * i) % MOD; } ifac[N - 1] = PowerMod(fac[N - 1], MOD - 2, MOD); for(i = N - 2; i >= 0; i--){ ifac[i] = (ifac[i + 1] * (i + 1)) % MOD; } } ll ways(int r1, int c1, int r2, int c2) { return (((fac[r2-r1+1+c2-c1+1-2]*ifac[r2-r1])%MOD)*ifac[c2-c1])%MOD; } int main() { ios_base::sync_with_stdio(0); pre(); int t; cin>>t; while(t-->0){ ll ans = 0; int n,m; cin>>n>>m; int r1,c1,r2,c2; cin>>r1>>c1>>r2>>c2; for(int i=r2+1,j=c1-1; i<=n && j>=1; i++, j--) { ans = (ans+ways(1,1,i,j)*ways(i,j,n,m))%MOD; } for(int i=r1-1,j=c2+1; i>=1 && j<=m; i--, j++) { ans = (ans+ways(1,1,i,j)*ways(i,j,n,m))%MOD; } cout<<ans<<endl; } return 0; }