#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;

int T;
int H,W;
int h[4],w[4];

int main(){
	ios::sync_with_stdio(0);
	cin>>T;
	while(T--){
		cin>>H>>W;
		for(int i=1;i<=3;i++)
			cin>>h[i]>>w[i];
		
		int x=0;
		for(int i=1;i<=3;i++)
			if(h[i]==H||w[i]==W)
				x=i;
		for(int i=1;i<=3;i++)
			if(h[i]==H&&w[i]==W)
				x=i;
		if(x==0){
			cout<<0<<endl;
			continue;
		}
		if(w[x]==W){
			swap(H,W);
			for(int i=1;i<=3;i++)
				swap(h[i],w[i]);
		}
		if(w[x]==W){
			ll res=1;
			for(int i=1;i<=3;i++)
				if(i!=x)
					res=res*(W-w[i]+1)%mod*(H-h[i]+1)%mod;
			cout<<res<<endl;
			continue;
		}
		int y=0;
		for(int i=1;i<=3;i++)
			if(i!=x&&h[i]==H)
				y=i;
		if(y==0){
			int ht=0;
			for(int i=1;i<=3;i++)
				if(i!=x)
					ht+=h[i];
			if(ht<H){
				cout<<0<<endl;
				continue;
			}
			for(int i=1;i<=3;i++)
				if(i!=x)
					if(w[i]+w[x]<W){
						cout<<0<<endl;
						continue;
					}
			cout<<4<<endl;
			continue;
		}
		int z=0;
		for(int i=1;i<=3;i++)
			if(i!=x&&i!=y)
				z=i;
		if(h[z]==H){
			if((ll)w[x]+w[y]+w[z]<W){
				cout<<0<<endl;
				continue;
			}
			ll res=0;
			for(int i=1;i<=3;i++)
				for(int j=1;j<=3;j++){
					if(j==i)
						continue;
					for(int k=1;k<=3;k++){
						if(k==i||k==j)
							continue;
						if(w[i]+w[j]>=W)
							res+=W-w[k]+1;
						else
							res+=min(min(w[i]+1,W-w[j]),W-w[k]+1)-max(max(w[i]-w[k]+2,W-w[j]-w[k]+1),1)+1;
//						cout<<i<<' '<<j<<' '<<k<<" res "<<res<<endl;
						if(k>i&&w[k]+w[j]>=W)
							res--;
						if(k>j&&w[k]+w[i]>=W)
							res--;
					}
				}
			res%=mod;
			cout<<res<<endl;
			continue;
		}
		if(w[x]+w[y]<W){
			cout<<0<<endl;
			continue;
		}
		cout<<(ll)(W-w[z]+1)*(H-h[z]+1)*2%mod<<endl;
	}
	
	
	return 0;
}