#include<bits/stdc++.h>
using namespace std;
#define mod 1000000007
int T;
int n,m,a,b,c,d,e,f;
long long ans;
int sol(int x,int y,int z){
	if(x+y>=m)return (m-z+1);
	int l=max(1,m-y-z+1),r=min(m,x+z);
	return (r-l+1-z+1)%mod;
}
int main(){
	//freopen("1.in","r",stdin);
	cin>>T;
	int jsqq=0;
	while(T--){
		jsqq++;
		scanf("%d%d%d%d%d%d%d%d",&n,&m,&a,&b,&c,&d,&e,&f);
		if(jsqq==314){
			cout<<n<<" "<<m<<" "<<a<<" "<<b<<" "<<c<<" "<<d<<" "<<d<<" "<<f<<endl;
			return 0;
		}
		if(a==n&&b==m){
			ans=1ll*(n-c+1)*(m-d+1)%mod*(n-e+1)%mod*(m-f+1)%mod;
			printf("%lld\n",ans);continue;
		}
		swap(a,c);swap(b,d);
		if(a==n&&b==m){
			ans=1ll*(n-c+1)*(m-d+1)%mod*(n-e+1)%mod*(m-f+1)%mod;
			printf("%lld\n",ans);continue;
		}
		swap(a,e);swap(b,f);
		if(a==n&&b==m){
			ans=1ll*(n-c+1)*(m-d+1)%mod*(n-e+1)%mod*(m-f+1)%mod;
			printf("%lld\n",ans);continue;
		}
		int jsq=(a==n)+(b==m)+(c==n)+(d==m)+(e==n)+(f==m);
		if(!jsq){puts("0");continue;}
		else if(jsq==1){
			if((c==n)||(d==m)){swap(a,c);swap(b,d);}
			if((e==n)||(f==m)){swap(a,e);swap(b,f);}
			if(b==m){swap(a,b);swap(c,d);swap(e,f);swap(n,m);}
			if(d<m-b||f<m-b){puts("0");continue;}
			if(c+e<n){puts("0");continue;}
			puts("4");
			continue;
		}
		else if(jsq==2){
			if((c==n)||(d==m)){swap(a,c);swap(b,d);}
			if((e==n)||(f==m)){swap(a,e);swap(b,f);}
			if((e==n)||(f==m)){swap(c,e);swap(d,f);}
			if(b==m){swap(a,b);swap(c,d);swap(e,f);swap(n,m);}
			if(c==n){
				if(b+d<m){puts("0");continue;}
				ans=2ll*(n-e+1)*(m-f+1)%mod;
				printf("%lld\n",ans);continue;
			}
			else{
				if(d<m-b||f<m-b){puts("0");continue;}
				if(c+e<n){puts("0");continue;}
				puts("4");
				continue;
			}
		}
		else if(jsq==3){
			if(b==m){swap(a,b);swap(c,d);swap(e,f);swap(n,m);}
			if(a==n&&c==n&&e==n){
				if(b+d+f<m){puts("0");continue;}
				ans=0;
				if(d>b)swap(b,d);if(f>b)swap(b,f);if(f>d)swap(d,f);
				if(d+f>=m)ans=(ans-6+mod)%mod;
				else if(b+f>=m)ans=(ans-6+mod)%mod;
				else if(b+d>=m)ans=(ans-4+mod)%mod;
				ans=(ans+2*sol(b,d,f))%mod;
				ans=(ans+2*sol(b,f,d))%mod;
				ans=(ans+2*sol(d,f,b))%mod;
				printf("%lld\n",ans);continue;
			}
			else{
				if(c!=n&&e!=n){swap(a,b);swap(c,d);swap(e,f);swap(n,m);swap(a,e);swap(b,f);}
				else if(c!=n){swap(c,e);swap(d,f);}
				if(b+d<m){puts("0");continue;}
				ans=2ll*(n-e+1)*(m-f+1)%mod;
				printf("%lld\n",ans);continue;
			}
		}
	}
}