#include <bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
void solve(){
	int n,m,sum=1,ok=0,ans=0;
	cin>>n>>m;
	vector<int> h(3),w(3),x(3),y(3);
	for(int i:{0,1,2}){
		cin>>h[i]>>w[i];
		if(h[i]==n&&w[i]==m) ok=1;
		sum=(n-h[i]+1ll)*(m-w[i]+1ll)%mod*sum%mod;
	}
	if(ok){
		cout<<sum<<"\n";
		return;
	}
	auto calc=[&](){
		set<int> sx{1,n},sy{1,m};
		for(int i:{0,1,2})
			sx.insert(x[i]),sx.insert(x[i]-1),sx.insert(x[i]+h[i]),sx.insert(x[i]+h[i]-1),
			sy.insert(y[i]),sy.insert(y[i]-1),sy.insert(y[i]+w[i]),sy.insert(y[i]+w[i]-1);
		for(int i:sx) if(i>0&&i<=n) for(int j:sy) if(j>0&&j<=m){
			bool fl=0;
			for(int t:{0,1,2}) if(i>=x[t]&&i<x[t]+h[t]&&j>=y[t]&&j<y[t]+w[t]) fl=1;
			if(!fl) return;
		}
		ans++;
	};
	auto dfs=[&](auto self,int d)->void{
		if(d==3) return calc();
		set<array<int,2>> s;
		for(int i:{1,n-h[d]+1}) for(int j:{1,m-w[d]+1}) s.insert({i,j});
		for(auto t:s) x[d]=t[0],y[d]=t[1],self(self,d+1);
	};
	dfs(dfs,0);
	for(int i:{0,1,2}) for(int j:{0,1,2}) if(i!=j){
		int k=3^i^j;
		if((h[i]==n&&h[j]==n&&w[i]+w[j]>=m)||(w[i]==m&&w[j]==m&&h[i]+h[j]>=n)){
			(ans+=(n-h[k]+1ll)*(m-w[k]+1ll)%mod)%=mod;
			if(h[k]==n||w[k]==m) (ans+=mod-2)%=mod;
			else (ans+=mod-4)%=mod;
		}else if(h[i]==n&&h[j]==n&&h[k]==n){
			int l=max(2,m-w[j]-w[k]+1),r=min(w[i]+1,m-w[k]);
			(ans+=max(r-l+1,0))%=mod;
		}else if(w[i]==m&&w[j]==m&&w[k]==m){
			int l=max(2,n-h[j]-h[k]+1),r=min(h[i]+1,n-h[k]);
			(ans+=max(r-l+1,0))%=mod;
		}
	}
	cout<<ans<<"\n";
}
int main(){
	cin.tie(0)->sync_with_stdio(0);
	int t;
	cin>>t;
	while(t--) solve();
	return 0;
}