#include <bits/stdc++.h>

using namespace std;

long long H, W;
pair<long long, long long> arr[3];
const long long MOD = 1e9+7;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    while(T--) {
        cin >> H >> W;
        int hcnt = 0;
        int wcnt = 0;
        bool tot = 0;
        for (int i = 0; i < 3; i++) {
            cin >> arr[i].first >> arr[i].second;
            if (arr[i].first == H && arr[i].second == W) {
                tot = 1;
            }
            else if (arr[i].first == H) {
                wcnt++;
            }
            else if (arr[i].second == W) {
                hcnt++;
            }
        }
        if (tot) {
            long long ans = 1;
            for (auto p : arr) {
                ans *= (H - p.first + 1) * (W - p.second + 1) % MOD;
                ans %= MOD;
            }
            cout << ans << "\n";
            continue;
        }

        if (wcnt >= 2) {
            swap(wcnt, hcnt);
            swap(H, W);
            for (auto& p : arr) {
                swap(p.first, p.second);
            }
        }

        if (hcnt == 3) {
            vector<int> v = {0, 1, 2};
            long long ans = 0;
            do {
                long long gap = H - arr[v[0]].first - arr[v[1]].first;
                gap = max(gap, 0LL);

                if (gap == 0) {
                    ans += H - arr[v[2]].first + 1;
                }
                else {
                    long long r = min(arr[v[0]].first, H - arr[v[2]].first);
                    long long l = max(arr[v[0]].first + gap - arr[v[2]].first, 0LL);
                    ans += r - l + 1;
                }
                // cout << arr[v[0]].first << " " << arr[v[1]].first << " " << arr[v[2]].first << " " << H << " " << ans << "\n";

                if (max(arr[v[0]].first, arr[v[1]].first) + arr[v[2]].first >= H) {
                    ans--;
                }
                // cout << arr[v[0]].first << " " << arr[v[1]].first << " " << arr[v[2]].first << " " << H << " " << ans << "\n";
            }
            while(next_permutation(v.begin(), v.end()));
            cout << ans % MOD << "\n";
            continue;
        }
        else if (hcnt == 2) {
            long long sum = 0;
            long long ans = 0;
            for (auto& p : arr) {
                if (p.second == W) {
                    sum += p.first;
                }
                else {
                    ans = 2 * (H - p.first + 1) * (W - p.second + 1) % MOD;
                }
            }
            cout << (sum >= H) * ans << "\n";
            continue;
        }

        if (wcnt >= 1) {
            swap(wcnt, hcnt);
            swap(H, W);
            for (auto& p : arr) {
                swap(p.first, p.second);
            }            
        }

        if (hcnt >= 1) {
            for (int i = 0; i < 3; i++) {
                if (arr[i].second == W) {
                    swap(arr[0], arr[i]);
                    break;
                }
            }
            if (arr[0].first + min(arr[1].first, arr[2].first) >= H && arr[1].second + arr[2].second >= W) {
                cout << 4 << "\n";
            }
            else {
                cout << 0 << "\n";
            }
        }
        else {
            cout << 0 << "\n";
        }
    }
}