#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<int,int,int> pnt;

const int N=105;
int n,m,s,t,dis[N][N][N];
bool blo[N][N][N];
bool chk(int x,int y,int z){
    if(x<=0||x>n||y<=0||y>n||z<=0||z>n||blo[x][y][z]||dis[x][y][z])return 0;
    return 1;
}
void solve(){
    cin>>n>>m;
    int x1,y1,z1,x2,y2,z2;
    memset(dis,0,sizeof(dis));
    memset(blo,0,sizeof(blo));
    while(m--){
        cin>>x1>>y1>>z1>>x2>>y2>>z2;
        for(int i=x1;i<=x2;++i)
            for(int j=y1;j<=y2;++j)
                for(int k=z1;k<=z2;++k)
                    blo[i][j][k]=1;
    }
    cin>>x1>>y1>>z1>>x2>>y2>>z2;
    dis[x1][y1][z1]=1;
    queue<pnt> q;
    q.push(pnt(x1,y1,z1));
    while(!q.empty()){
        auto [x,y,z]=q.front();
        q.pop();
        if(chk(x-1,y,z))dis[x-1][y][z]=dis[x][y][z]+1,q.push(pnt(x-1,y,z));
        if(chk(x+1,y,z))dis[x+1][y][z]=dis[x][y][z]+1,q.push(pnt(x+1,y,z));
        if(chk(x,y-1,z))dis[x][y-1][z]=dis[x][y][z]+1,q.push(pnt(x,y-1,z));
        if(chk(x,y+1,z))dis[x][y+1][z]=dis[x][y][z]+1,q.push(pnt(x,y+1,z));
        if(chk(x,y,z-1))dis[x][y][z-1]=dis[x][y][z]+1,q.push(pnt(x,y,z-1));
        if(chk(x,y,z+1))dis[x][y][z+1]=dis[x][y][z]+1,q.push(pnt(x,y,z+1));
    }
    cout<<dis[x2][y2][z2]-1<<'\n';
}

int main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int T;
    cin>>T;
    while(T--)solve();
}