#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int Add(int x, int y) {
	return (x += y) >= mod ? x - mod : x;
}
int Mul(int x, int y) {
	return 1ll * x * y % mod;
}
int T, W, H, w[3], h[3];
int Ways(int a, int b) {
	return Mul(H - a + 1, W - b + 1);
}
vector<int> all, no;
int Check() {
	all.clear(), no.clear();
	for(int i = 0; i < 3; ++ i) {
		if(H == h[i]) {
			all.push_back(i);
		}
		else {
			no.push_back(i);
		}
	}
	if(!all.size()) {
		return -1;
	}
	if((int)all.size() == 1) {
		if(h[no[0]] + h[no[1]] >= H && min(w[no[0]], w[no[1]]) + w[all[0]] >= W) {
			if(w[no[0]] == W && w[no[1]] == W) {
				return Ways(h[all[0]], w[all[0]]) * 2;
			}
			return 4;
		}
		return 0;
	}
	if((int)all.size() == 2) {
		if(w[all[0]] + w[all[1]] >= W) {
			return Ways(h[no[0]], w[no[0]]) * 2;
		}
		return 0;
	}
// cerr << "? " << endl;
	int ans = 0;
	for(int i = 0; i < 3; ++ i) {
		for(int j = 0; j < 3; ++ j) {
			if(i == j) {
				continue;
			}
			int id = -1;
			for(int k = 0; k < 3; ++ k) {
				if(i != k && j != k) {
					id = k;
					break;
				}
			}
			if(max(w[i], w[j]) + w[id] >= W) {
				ans = Add(ans, 1);
			}
			if(w[i] + w[j] >= W) {
				ans = Add(ans, max(0, W - w[id] - 1));
// cerr << i << " " << j << " " << ans << endl;
				continue;
			}
			int l = max(2, W - w[j] - w[id] + 1), r = min(W - w[id], w[i] + 1);
			if(l <= r) {
				ans = Add(ans, r - l + 1);
			}
// cerr << i << " " << j << " " << l << " " << r << " " << ans << endl;
		}
	}
	return ans;
}
int main() {
	for(scanf("%d", &T); T --; ) {
		scanf("%d%d", &H, &W);
		for(int i = 0; i < 3; ++ i) {
			scanf("%d%d", &h[i], &w[i]);
		}
		int full = 0;
		for(int i = 0; i < 3; ++ i) {
			if(H == h[i] && W == w[i]) {
				full = 1;
				break;
			}
		}
		if(full) {
			int ans = 1;
			for(int i = 0; i < 3; ++ i) {
				ans = Mul(ans, Ways(h[i], w[i]));
			}
			printf("%d\n", ans);
			continue;
		}
		int ans = Check();
		if(ans != -1) {
			printf("%d\n", ans);
			continue;
		}
		swap(H, W);
		for(int i = 0; i < 3; ++ i) {
			swap(h[i], w[i]);
		}
		ans = Check();
		if(ans != -1) {
			printf("%d\n", ans);
			continue;
		}
		puts("0");
	}
}