#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define int long long
const int mod = 1e9 + 7;

void solve()
{
	int H, W;
	cin >> H >> W;

	vector<int> vh, vw;
	int h[3], w[3];
	bool flag = 0;
	for (int i = 0; i < 3; i++) {
		cin >> h[i] >> w[i];
		if (h[i] == H)
			vh.push_back(i);
		if (w[i] == W)
			vw.push_back(i);
		if (h[i] == H && w[i] == W)
			flag = 1;
	}

	int cnth = vh.size(), cntw = vw.size();
	if (cnth < cntw) {
		swap(H, W);
		swap(h, w);
		swap(vh, vw);
		swap(cnth, cntw);
	}
	
	auto calc = [&](int i) {
		return (H - h[i] + 1) * (W - w[i] + 1) % mod;
	};
	if (flag) {
		cout << calc(0) * calc(1) % mod * calc(2) % mod << endl;
		return;
	}
	auto get_id = [&](int x) {
		vector<int> v;
		for (int i = 0; i < 3; i++)
			if (i != x) v.push_back(i);
		return make_pair(v[0], v[1]);
	};

	if (cnth == 0) {
		cout << 0 << endl;
	}
	if (cnth == 1) {
		int i = vh[0];
		auto [j, k] = get_id(i);
		if (w[i] + min(w[j], w[k]) < W || h[j] + h[k] < H)
			cout << 0 << endl;
		else
			cout << 4 << endl;
	}
	if (cnth == 2) {
		int i = vh[0], j = vh[1];
		int k = 3 - i - j;
		if (w[i] + w[j] >= W)
			cout << 2 * calc(k) % mod << endl;
		else
			cout << 0 << endl;
	}
	if (cnth == 3) {
		if (w[0] + w[1] + w[2] < W) {
			cout << 0 << endl;
			return;
		}
		int ans = 0;
		set<pair<int, int>> st;
		for (int i = 0; i < 3; i++) {
			for (int j = 0; j < 3; j++) {
				if (i == j) continue;
				int k = 3 - i - j;
				if (w[i] + w[j] < W) {
					ans += min(w[k] - (W - w[i] - w[j]) + 1, W - w[k] + 1);
					ans %= mod;
					if (w[k] >= W - w[i])
						st.insert({ min(k, j), max(k, j) });
					if (w[k] >= W - w[j])
						st.insert({ min(k, i), max(k, i) });
				}
				else {
					ans += W - w[k] + 1;
					ans %= mod;
					st.insert({ min(k, i), max(k, i) });
					st.insert({ min(k, j), max(k, j) });
				}
			}
		}
		ans = (ans - 2 * st.size() + mod) % mod;
		cout << ans << endl;
	}
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);

	int t;
	cin >> t;

	while (t--)
		solve();
}