#include <iostream>
const int maxn = 1e5;
using namespace std;
typedef long long LL;
const LL mod =1e9+7;
int T,n,m,a[3],b[3],l[maxn+10],r[maxn+10],ans[maxn+10],i,j,k,p;
int F(){
   return abs(a[j]-l[i])+1+abs(b[j]-a[k])+1+abs(b[k]-a[p])+1+abs(b[p]-r[i]);
}
void read() {
    int tmp;
    scanf("%d%d", &n, &m);
    for (i = 0; i < 3; ++i)scanf("%d%d", a + i, b + i);
    for (i = 1; i <= m; ++i)scanf("%d%d", l + i, r + i);
    for (i = 1; i <= m; ++i)ans[i] = abs(r[i] - l[i]);
    for (i = 1; i <= m; ++i) {
        for (j = 0; j < 3; ++j) {
            tmp = abs(l[i] - a[j]) + 1 + abs(b[j] - r[i]);
            tmp = min(tmp, abs(r[i] - a[j]) + 1 + abs(b[j] - l[i]));
            ans[i] = min(ans[i], tmp);
        }
    }
    for (i = 1; i <= m; ++i) {
        for (j = 0; j < 3; ++j) {
            for (k = 0; k < 3; ++k) {
                if (j == k)continue;
                tmp = abs(l[i] - a[j]) + 1 + abs(b[j] - a[k]) + 1 + abs(b[k] - r[i]);
                swap(a[j], b[j]);
                tmp = min(tmp, abs(l[i] - a[j]) + 1 + abs(b[j] - a[k]) + 1 + abs(b[k] - r[i]));
                swap(a[k], b[k]);
                tmp = min(tmp, abs(l[i] - a[j]) + 1 + abs(b[j] - a[k]) + 1 + abs(b[k] - r[i]));
                swap(a[j], b[j]);
                tmp = min(tmp, abs(l[i] - a[j]) + 1 + abs(b[j] - a[k]) + 1 + abs(b[k] - r[i]));
                swap(a[k], b[k]);
                ans[i] = min(ans[i], tmp);
            }
        }
    }
    for (i = 1; i <= m; ++i) {
        for (j = 0; j < 3; ++j) {
            for (k = 0; k < 3; ++k) {
                if (j == k)continue;
                for (p = 0; p < 3; ++p) {
                    if (p == j || p == k)continue;
                    tmp = F();
                    swap(a[j], b[j]);
                    tmp = min(tmp, F());
                    swap(a[k], b[k]);
                    tmp = min(tmp, F());
                    swap(a[j], b[j]);
                    tmp = min(tmp, F());
                    swap(a[k], b[k]);
                    swap(a[p], b[p]);
                    tmp = min(tmp, F());
                    swap(a[j], b[j]);
                    tmp = min(tmp, F());
                    swap(a[k], b[k]);
                    tmp = min(tmp, F());
                    swap(a[j], b[j]);
                    tmp = min(tmp, F());
                    swap(a[k], b[k]);
                    swap(a[p], b[p]);
                    ans[i] = min(ans[i], tmp);
                }
            }
        }
    }
}
void work(){
    long long sum=0,tmp;
    for(i=1;i<=m;++i){
        tmp=ans[i];
        tmp=(tmp*i)%mod;
        sum=(sum+tmp)%mod;
    }
    cout<<sum<<endl;
}
int main() {
    scanf("%d",&T);
    while(T--){
        read();
        work();
    }
    return 0;
}