#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

typedef long long ll;
const int P = 1E9 + 7;
int T,n,m,ans,x[9],y[9]; ll mx;

void read(int &x)
{
	char c = getchar(); x = 0;
	while(c < '0' || c > '9') c = getchar();
	while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
}

int count(int x,int y) { return max(0,y - x + 1); }

int main()
{
	for(read(T);T--;)
	{
		read(n), read(m), mx = 0ll;
		
		for(int i = 0;i < 3; ++ i)
			read(x[i]), read(y[i]), mx = max(mx,1ll * x[i] * y[i]);
		
		if(mx == 1ll * n * m)
		{
			ans = 1;
			for(int i = 0;i < 3; ++ i)
				ans = 1ll * ans * (n - x[i] + 1) % P * (m - y[i] + 1) % P;
			printf("%d\n",ans);
			
			continue;
		}
		
		int tmp1 = (x[0] == n) + (x[1] == n) + (x[2] == n);
		int tmp2 = (y[0] == m) + (y[1] == m) + (y[2] == m);
		
		if(tmp1 < tmp2) swap(n,m), swap(x[0],y[0]), swap(x[1],y[1]), swap(x[2],y[2]), swap(tmp1,tmp2);
		
		if(!tmp1) printf("0\n");
		else if(tmp1 == 3)
		{
			ans = 0ll;
			if(y[0] + y[1] + y[2] < m) { printf("0\n"); continue; }
			
			for(int i = 0;i < 3; ++ i)
				for(int j = 0,l,r;j < 3; ++ j) if(i != j)
				{
					l = y[i], r = m - y[j];
					
					if(y[i] + y[j] >= m) ans = (ans + m - y[3 - i - j] + 1) % P;
					else ans = (ans + count(max(r - y[3 - i - j],0),min(m - y[3 - i - j],l))) % P;
				}
			
			for(int i = 0;i < 3; ++ i)
				for(int j = 0;j < 3; ++ j)
					if(i != j && max(y[i],y[j]) + y[3 - i - j] >= m) --ans;
			printf("%d\n",(ans + P) % P);
			
			continue;
		}
		else if(tmp1 == 2)
		{
			if(x[1] < n) swap(x[0],x[1]), swap(y[0],y[1]);
			if(x[2] < n) swap(x[0],x[2]), swap(y[0],y[2]);
			
			if(y[1] + y[2] < m) printf("0\n");
			else printf("%lld\n",2ll * (n - x[0] + 1) % P * (m - y[0] + 1) % P);
		}
		else if(tmp1 == 1)
		{
			if(x[1] == n) swap(x[0],x[1]), swap(y[0],y[1]);
			if(x[2] == n) swap(x[0],x[2]), swap(y[0],y[2]);
			
			if(x[1] + x[2] >= n && min(y[1],y[2]) + y[0] >= m) printf("4\n");
			else printf("0\n");
		}
	}
	
	return 0;
}