#include <bits/stdc++.h>
using namespace std;
using ll =long long;
const ll M=1000000007;
#define int long long
void solve(void) {
    int H,W;cin>>H>>W;
    vector<int> h(3),w(3);
    bool fm=false;
    vector<int> p[2];
    bool redone=false;
    for(int i=0;i<3;i++){
        cin>>h[i]>>w[i];
        if(h[i]==H&&w[i]==W){
            fm=true;
        }
        if(h[i]>H||w[i]>W)  redone=true;
        if(h[i]==H) p[0].push_back(i); 
        if(w[i]==W) p[1].push_back(i); 
    }
    if(redone)  {cout<<"0\n";return ;}
    if(fm){
        ll ans=1;
        for(int i=0;i<3;i++){
            if(!(h[i]==H&&w[i]==W)){
                ans=ans*(H-h[i]+1)%M*(W-w[i]+1)%M;
            }
        }
        cout<<ans<<'\n';
        return ;
    }
    if(p[0].size()==3){
        sort(w.begin(),w.end());
        ll ans=0;
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){
                if(i==j)    continue; 
                int del=3-(i+j);
                int lo=max(((w[i]+w[j]>=W)?1:W-w[j])-w[del]+1,(del<i?1ll:2ll));
                int ro=min(((w[i]+w[j]>=W)?W:w[i]+1),(del<j?W-w[del]+1:W-w[del]));
                ans=(ans+max(0ll,ro-lo+1))%M;
            }
        }
        cout<<ans<<'\n';
        return ;
    }
    if(p[1].size()==3){
        sort(h.begin(),h.end());
        ll ans=0;
        for(int i=0;i<3;i++){
            for(int j=0;j<3;j++){
                if(i==j)    continue; 
                int del=3-(i+j);
                int lo=max(((h[i]+h[j]>=H?1:H-h[j]-h[del]+1)),(del<i?1ll:2ll));
                int ro=min((h[i]+h[j]>=H?H:h[i]+1),(del<j?H-h[del]+1:H-h[del]));
                ans=(ans+max(0ll,ro-lo+1))%M;
            }
        }
        cout<<ans<<'\n';
        return ;
    }
    if(p[0].size()==2){
        int del=(3-p[0][0]-p[0][1]);
        if(w[p[0][0]]+w[p[0][1]]>=W){
            cout<<2*(H-h[del]+1)*(W-w[del]+1)%M<<'\n';
        }
        else cout<<"0\n";
        return ;
    }
    if(p[1].size()==2){
        int del=(3-p[1][0]-p[1][1]);
        if(w[p[1][0]]+w[p[1][1]]>=W){
            cout<<2*(H-h[del]+1)*(W-w[del]+1)%M<<'\n';
        }
        else cout<<"0\n";
        return ;
    }
    if(p[0].size()==0&&p[1].size()==0){cout<<"0\n";return ;}
    if(p[0].size()==1&&p[1].size()==1){
        int del=3-p[0][0]-p[1][0];
        if(h[del]+h[p[1][0]]>=H&&w[del]+w[p[0][0]]>=W){
            cout<<"4\n";
            return ;
        }  
        else {cout<<"0\n";return ;}
    }
    int dw=0;
    if(p[0].size()==1){
        dw=p[0][0];
        swap(H,W);
        for(int j=0;j<3;j++)    swap(w[j],h[j]);  
    }
    else dw=p[1][0];
    vector<int> sy;
    for(int i=0;i<3;i++)    if(i!=dw)   sy.push_back(i);
    if(min(h[sy[0]],h[sy[1]])+h[dw]>=H&&w[sy[0]]+w[sy[1]]>=W){
        cout<<"4\n";
        return ;
    }
    else cout<<"0\n";

    return;
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);


    int _ = 1;
    cin>>_;
    while (_--) solve();

    return 0;
}
/*
0
4
4
6
2


6
0
2
0


2401
*/