// We are the dreamers , we make it happen !
// I see, I like, I go again !
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>

#define ll long long
#define ull unsigned long long
#define db double
#define mkp make_pair
#define pii pair<int, int>
#define vc vector
#define pb emplace_back

//#define int long long

using namespace std;
const int N = 1e6 + 5, P = 1e9 + 7;
const int inf = 0x3f3f3f3f;
//const ll inf = 0x3f3f3f3f3f3f3f3f;

mt19937 gen(time(0));

inline int read() {
int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
} 
inline void write(int x) {
if(x < 0) putchar('-'), x = -x;
if(x > 9) write(x / 10); 
putchar(x % 10 + '0');
}
inline void writec(int x) { write(x); putchar(32); }
inline void writee(int x) { write(x); putchar(10); }

inline void inc(int &x, int y) { x += y - P; x += (x >> 31) & P; }
inline void dec(int &x, int y) { x -= y; x += (x >> 31) & P; }
inline int pls(int x, int y) { x += y - P; x += (x >> 31) & P; return x; }
inline int power(int a, int b) { int res = 1; for(; b; b >>= 1, a = 1ll * a * a % P) if(b & 1) res = 1ll * res * a % P; return res; } 

int H, W, ans, c[5], h[5], w[5];
vc<pii> o[5];

inline bool check(vc<pii> cur) {

auto ok = [&](vc<pii> cur, int lmt) -> bool {
sort(cur.begin(), cur.end()); int p = 0;
for(auto u: cur) 
if(u.first > p + 1) return 0;
else p = max(p, u.second);
return p == lmt; 
};

vc<int> pos; pos.pb(1); pos.pb(W);
for(int i = 1; i <= 3; i++) pos.pb(cur[i].second + w[i]);
for(auto u: pos) if(u <= W) {
vc<pii> now;
for(int i = 1; i <= 3; i++) if(cur[i].second <= u && cur[i].second + w[i] - 1 >= u)
now.pb(mkp(cur[i].first, cur[i].first + h[i] - 1));
if(!ok(now, H)) return 0;
}
return 1;
}

int TIME;
inline void solve() {
H = read(); W = read(); int all = 1, sum = 0; ans = 0;
ll mask = 0;
for(int i = 1, len; i <= 3; i++) {
h[i] = read(); w[i] = read(); mask += 1ll * h[i] * w[i];
c[i] = 1ll * (H - h[i] + 1) * (W - w[i] + 1) % P; 
all = 1ll * all * c[i] % P; inc(sum, c[i]);
o[i].clear();
o[i].pb(mkp(1, 1));
o[i].pb(mkp(1, W - w[i] + 1));
o[i].pb(mkp(H - h[i] + 1, 1));
o[i].pb(mkp(H - h[i] + 1, W - w[i] + 1));
sort(o[i].begin(), o[i].end()); 
len = unique(o[i].begin(), o[i].end()) - o[i].begin();
while(o[i].size() > len) o[i].pop_back();
}

if(mask < 1ll * H * W) return puts("0"), void();
for(int i = 1; i <= 3; i++) if(c[i] == 1) return writee(all), void();

for(int i = 1, l, r, k; i <= 3; i++) if(h[i] == H) 
for(int j = 1; j <= 3; j++) if(i != j && h[j] == H) {
l = w[i]; r = W - w[j] + 1; k = 6 - i - j;
if(l + 1 < r) {
if(h[k] == H) 
inc(ans, max(0, min(l + 1, W - w[k]) - max(r - w[k], 2) + 1));
}
else inc(ans, pls(c[k], P - o[k].size()));
}

for(int i = 1, l, r, k; i <= 3; i++) if(w[i] == W)
for(int j = 1; j <= 3; j++) if(i != j && w[j] == W) {
l = h[i]; r = H - h[j] + 1; k = 6 - i - j;
if(l + 1 < r) {
if(w[k] == W) 
inc(ans, max(0, min(l + 1, H - h[k]) - max(r - h[k], 2) + 1));
}
else inc(ans, pls(c[k], P - o[k].size()));
}

for(auto x: o[1]) for(auto y: o[2]) for(auto z: o[3]) {
vc<pii> cur; 
cur.pb(mkp(0, 0)); cur.pb(x); cur.pb(y); cur.pb(z);
if(check(cur)) ++ans;
}
writee(ans % P);
}

signed main() {
int t = read(); while(t--) solve();
return 0;
}