#include <bits/stdc++.h>

using namespace std;

#define iter(v) v.begin(), v.end()
#define SZ(v) int(v.size())
#define pb emplace_back
#define ff first
#define ss second
#define fs ff
#define sc ss

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#ifdef zisk
void debug(){cerr << "\n";}
template<class T, class ... U>
void debug(T a, U ... b){cerr << a << " ", debug(b...);}
template<class T> void pary(T l, T r){
	while (l != r) cerr << *l << " ", l++;
	cerr << "\n";
}
#else
#define debug(...) void()
#define pary(...) void()
#endif

template<class A, class B>
ostream &operator<<(ostream& o, pair<A, B> p) {
	return o << '(' << p.ff << ',' << p.ss << ')';
}

const int mod=1e9+7;
void add(int& a,int b){
	a+=b;
	a-=mod*(a>=mod);
	a+=mod*(a<0);
}
int mul(int a,int b){
	return 1ll*a*b%mod;
}
int h,w;
int get(pair<int,int> x){
	return mul((h-x.fs+1),(w-x.sc+1));
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int t;
	cin >> t;
	while(t--){
		cin >> h >> w;
		vector<pair<int,int> > v(3);
		cin >> v[0].fs >> v[0].sc >> v[1].fs >> v[1].sc >> v[2].fs >> v[2].sc;
		if(v[0].fs==h && v[0].sc==w){
			cout << mul(get(v[1]),get(v[2])) << "\n";
		}
		else if(v[1].fs==h && v[1].sc==w){
			cout << mul(get(v[0]),get(v[2])) << "\n";
		}
		else if(v[2].fs==h && v[2].sc==w){
			cout << mul(get(v[0]),get(v[1])) << "\n";
		}
		else{
			int a=0,b=0;
			for(int i=0;i<3;i++){
				if(v[i].fs==h){
					a++;
				}
				if(v[i].sc==w){
					b++;
				}
			}
			if(b>a){
				swap(h,w);
				for(int i=0;i<3;i++){
					swap(v[i].fs,v[i].sc);
				}
				swap(a,b);
			}
			//debug(a,b);
			if(a==3){
				if(v[0].sc+v[1].sc+v[2].sc<w){
					cout << 0 << "\n";
				}
				else{
					int ans=0;
					for(int i=0;i<3;i++){
						if(v[i].sc+v[(i+1)%3].sc>=w){
							add(ans,mul(2,w-v[(i+2)%3].sc-1));
						}
						else{
							int l=max(1,w-v[(i+1)%3].sc-v[(i+2)%3].sc);
							int r=min(w-v[(i+2)%3].sc-1,v[i].sc);
							add(ans,mul(2,r-l+1));
						}
					}
					for(int i=0;i<3;i++){
						if(max(v[i].sc,v[(i+1)%3].sc)+v[(i+2)%3].sc>=w){
							add(ans,2);
						}
					}
					cout << ans << "\n";
				}
			}
			else if(a==2){
				sort(v.begin(),v.end(),greater<>());
				if(v[0].sc+v[1].sc>=w){
					cout << mul(2,get(v[2])) << "\n";
				}
				else{
					cout << 0 << "\n";
				}
			}
			else if(a==1){
				sort(v.begin(),v.end(),greater<>());
				if(v[1].fs+v[2].fs>=h && v[0].sc+min(v[1].sc,v[2].sc)>=w){
					cout << 4 << "\n";
				}
				else{
					cout << 0 << "\n";
				}
			}
			else{
				cout << 0 << "\n";
			}
		}
	}
}