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

#define F first
#define S second 
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()

typedef long long ll;

const int N = 1e6 + 2;
const int mod = 1e9 + 7;

inline int add(int a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    return a;
}

inline int sub(int a, int b) {
    a -= b;
    if (a < 0) a += mod;
    return a;
}

inline int mul(int a, int b) {
    return a * 1ll * b % mod;
}

int H, W, h[3], w[3];
int px[3], py[3];
int ans = 0;

void rec(int i) {
    if (i == 3) {
        int mx = -1, mn = H + 1;
        for (int j = 0; j < 3; ++j) if (px[j] == 0) {
                if (py[j] == 0) mx = max(mx, py[j] + h[j]);
                if (py[j] + h[j] == H) mn = min(mn, py[j]);
        }
        if (mn > mx) return;
        mx = -1, mn = H + 1;
        for (int j = 0; j < 3; ++j) if (px[j] + w[j] == W) {
                if (py[j] == 0) mx = max(mx, py[j] + h[j]);
                if (py[j] + h[j] == H) mn = min(mn, py[j]);
        }
        if (mn > mx) return;
        mx = -1, mn = W + 1;
        for (int j = 0; j < 3; ++j) if (py[j] == 0) {
                if (px[j] == 0) mx = max(mx, py[j] + h[j]);
                if (px[j] + w[j] == W) mn = min(mn, py[j]);
        }
        if (mn > mx) return;
        mx = -1, mn = W + 1;
        for (int j = 0; j < 3; ++j) if (py[j] + h[j] == H) {
                if (px[j] == 0) mx = max(mx, px[j] + w[j]);
                if (px[j] + w[j] == W) mn = min(mn, px[j]);
        }
        if (mn > mx) return;
        int now = 1;
        for (int j = 0; j < 3; ++j) if (px[j] == -1) {
            now = mul(now, max((H - h[j] + 1) * 1ll * (W - w[j] + 1) - (4 - 2 * (h[j] == H) - 2 * (w[j] == W)), 0ll));
        }
        ans = add(ans, now);
        return;
    }
    if (h[i] == H && w[i] == W) {
        px[i] = 0, py[i] = 0;
        rec(i + 1);
        px[i] = -1, py[i] = -1;
        rec(i + 1);
    }
    else if (h[i] == H) {
        px[i] = 0, py[i] = 0;
        rec(i + 1);
        px[i] = W - w[i], py[i] = 0;
        rec(i + 1);
        px[i] = -1, py[i] = -1;
        rec(i + 1);
    }
    else if (w[i] == W) {
        px[i] = 0, py[i] = 0;
        rec(i + 1);
        px[i] = 0, py[i] = H - h[i];
        rec(i + 1);
        px[i] = -1, py[i] = -1;
        rec(i + 1);
    }
    else {
        px[i] = 0, py[i] = 0;
        rec(i + 1);
        px[i] = W - w[i], py[i] = 0;
        rec(i + 1);
        px[i] = 0, py[i] = H - h[i];
        rec(i + 1);
        px[i] = W - w[i], py[i] = H - h[i];
        rec(i + 1);
        px[i] = -1, py[i] = -1;
        rec(i + 1);
    }
}

void solve() {
    ans = 0;
    cin >> H >> W;
    int kek = 0, cnt = 1;
    for (int i = 0; i < 3; ++i) {
        cin >> h[i] >> w[i];
        if (h[i] == H && w[i] == W) {
            kek++;
        }
        else {
            cnt = mul(cnt, mul(H - h[i] + 1, W - w[i] + 1));
        }
        px[i] = -1, py[i] = -1;
    }
    if (kek > 0) {
        cout << cnt << '\n';
        return;
    }
    rec(0);
    int hh = 0, ww = 0;
    for (int i = 0; i < 3; ++i) {
        if (h[i] == H) hh++;
        if (w[i] == W) ww++;
    }
    if (hh == 3) {
        for (int i = 0; i < 3; ++i) {
            for (int j = 0; j < 3; ++j) {
                if (i == j) continue;
                for (int k = 0; k < 3; ++k) {
                    if (k == j || k == i) continue;
                    if (W <= w[i] + w[j]) continue;
                    if (W - w[i] - w[j] > w[k]) continue;
                    ans = add(ans, max(0, min(w[i], W - w[k] - 1)- max((W - w[j] - w[k]), 1) + 1));
                }
            }
        }
    }
    if (ww == 3) {
        for (int i = 0; i < 3; ++i) {
            swap(h[i], w[i]);
        }
        swap(H, W);
        for (int i = 0; i < 3; ++i) {
            for (int j = 0; j < 3; ++j) {
                if (i == j) continue;
                for (int k = 0; k < 3; ++k) {
                    if (k == j || k == i) continue;
                    if (W <= w[i] + w[j]) continue;
                    if (W - w[i] - w[j] > w[k]) continue;
                    ans = add(ans, max(0, min(w[i], W - w[k] - 1)- max((W - w[j] - w[k]), 1) + 1));
                }
            }
        }
    }
    cout << ans << '\n';
    return;
}

int main() {
    int T;
    cin >> T;
    while (T--) solve();
}