#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;
typedef vector<int> vi;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

constexpr int N = 5007;

struct rectan {
    int h, w;
    bool operator < (const rectan &obj) const {return h == obj.h ? (w < obj.w) : (h < obj.h);}
    bool operator > (const rectan &obj) const {return obj < (*this);}
    bool operator == (const rectan &obj) const {return !((*this) < obj || (*this) > obj);}
    bool operator != (const rectan &obj) const {return !(*this == obj);}
    bool operator <= (const rectan &obj) const {return !(*this > obj);}
    bool operator >= (const rectan &obj) const {return !(*this < obj);}
};

const int mod = 1000000007;

inline void calc() {
    rectan R{rd(), rd()};
    vector<rectan> r;
    int HW = 0, H = 0, W = 0;
    rep(i, 1, 3) {
        rectan rr{rd(), rd()};
        if(rr.h == R.h && rr.w == R.w) HW++;
        if(rr.h == R.h) H++;
        if(rr.w == R.w) W++;
        r.eb(rr);
    }
    if (HW > 0) {
        int ans = 1;
        for(auto rr : r) {
            int res = 1ll * (R.h - rr.h + 1) * (R.w - rr.w + 1) % mod;
            ans = (1ll * ans * res) % mod;
        }
        printf("%d\n", ans);
        return;
    }
    if (W > 0) {
        int ans = 0;
        if (W == 3) {
            sort(all(r));
            do {
                if (r[0].h + r[2].h >= R.h) ans = (ans + R.h - 1 - r[1].h) % mod;
                else {
                    int low = max(R.h - r[2].h - r[1].h + 1, 2);
                    int up = min(R.h - r[1].h, r[0].h + 1);
                    if (low <= up) ans = (ans + up - low + 1) % mod;
                }
            }while (next_permutation(all(r)));
            sort(all(r));
            if (r[0].h + r[2].h >= R.h) ans = (ans + 2) % mod;
            if (r[1].h + r[2].h >= R.h) ans = (ans + 4) % mod;
        }
        else if (W == 2) {
            if (r[0].w != R.w) swap(r[0], r[2]);
            if (r[1].w != R.w) swap(r[1], r[2]);
            if (r[0].h + r[1].h >= R.h) ans = (ans + 2ll * (R.h - r[2].h +1) * (R.w - r[2].w + 1) % mod) % mod;
        }
        else if (W == 1) {
            if (r[1].w == R.w) swap(r[1], r[0]);
            if (r[2].w == R.w) swap(r[2], r[0]);
            if(r[1].w + r[2].w >= R.w && r[1].h + r[0].h >= R.h && r[2].h + r[0].h >= R.h) ans = (ans + 4) % mod;
        }
        printf("%d\n", ans);
        return;
    }
    if (H > 0) {
        int ans = 0;
        if (H == 3) {
            sort(all(r));
            do {
                if (r[0].w + r[2].w >= R.w) ans = (ans + R.w - r[1].w - 1) % mod;
                else {
                    int low = max(R.w - r[2].w - r[1].w + 1, 2);
                    int up = min(R.w - r[1].w, r[0].w + 1);
                    if (low <= up) ans = (ans + up - low + 1) % mod;
                }
            }while (next_permutation(all(r)));
            sort(all(r));
            if (r[0].w + r[2].w >= R.w) ans = (ans + 2) % mod;
            if (r[1].w + r[2].w >= R.w) ans = (ans + 4) % mod;
        }
        else if (H == 2) {
            if (r[0].h != R.h) swap(r[0], r[2]);
            if (r[1].h != R.h) swap(r[1], r[2]);
            if (r[0].w + r[1].w >= R.w) ans = (ans + 2ll * (R.w - r[2].w +1) * (R.h - r[2].h + 1) % mod) % mod;
        }
        else if (H == 1) {
            if (r[1].h == R.h) swap(r[1], r[0]);
            if (r[2].h == R.h) swap(r[2], r[0]);
            if(r[1].h + r[2].h >= R.h && r[1].w + r[0].w >= R.w && r[2].w + r[0].w >= R.w) ans = (ans + 4) % mod;
        }
        printf("%d\n", ans);
        return;
    }
    puts("0");
    return;
}

int main() {
    per(i, rd(), 1) calc();
    return 0;
}

/*
5
2 2
1 1
1 1
1 1
2 2
1 1
1 2
1 2
2 2
1 1
1 2
2 1
2 2
1 2
1 2
1 2
2 2
1 2
1 2
2 1
*/