#include<bits/stdc++.h>
using namespace std;
int read(){
    char c;int res=0;
    while(!isdigit(c=getchar()));
    res=c-'0';
    while(isdigit(c=getchar()))
        res=res*10+c-'0';
    return res;
}
const int N=105;
const int M=1005;

#define out(x) cerr<<#x<<'='<<x<<' '
#define outln(x) cerr<<#x<<"="<<x<<"\n"
#define sz(x) (int)(x).size()
typedef long long ll;
const int inf=(int)1e9;
int ss[N][N][N],s[N][N][N];
int n,m;
int dx[]={1,-1,0,0,0,0};
int dy[]={0,0,1,-1,0,0};
int dz[]={0,0,0,0,1,-1};
int d[N][N][N];

void init(){
    n=read(); m=read();
    memset(s,0,sizeof(s));
    memset(ss,0,sizeof(ss));
    for(int i=1;i<=m;i++){
        int a=read(),b=read(),c=read(),d=read(),e=read(),f=read();
        ss[a][b][c]++; 
        ss[d+1][b][c]--;
        ss[a][e+1][c]--;
        ss[a][b][f+1]--;
        ss[d+1][e+1][c]++;
        ss[d+1][b][f+1]++;
        ss[a][e+1][f+1]++;
        ss[d+1][e+1][f+1]--;
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                s[i][j][k]=ss[i][j][k]+s[i-1][j][k]+s[i][j-1][k]+s[i][j][k-1]-s[i-1][j-1][k]-s[i-1][j][k-1]-s[i][j-1][k-1]+s[i-1][j-1][k-1];
                // out(i); out(j); out(k); outln(s[i][j][k]);
            }
        }
    }
}
int sx,sy,sz,ex,ey,ez;
struct node{
    int x,y,z;
};
int valid(int x,int y,int z){
    if(d[x][y][z]<inf) return 0;
    if(s[x][y][z]) return 0;
    if(x<1||x>n||y<1||y>n||z<1||z>n) return 0;
    return 1;
}

void bfs(){
    memset(d,0x3f,sizeof(d));
    d[sx][sy][sz]=0; 
    queue<node> q; q.push({sx,sy,sz});
    while(!q.empty()){
        node u=q.front(); q.pop();
        for(int i=0;i<6;i++){
            int xx=u.x+dx[i],yy=u.y+dy[i],zz=u.z+dz[i];
            if(!valid(xx,yy,zz)) continue;
            d[xx][yy][zz]=d[u.x][u.y][u.z]+1;
            q.push({xx,yy,zz});
        }
    }
}

void solve(){
    sx=read(),sy=read(),sz=read(),ex=read(),ey=read(),ez=read();
    bfs();
    if(d[ex][ey][ez]<inf) printf("%d\n",d[ex][ey][ez]);
    else puts("-1");
}

int main(){
    int T=read();
    while(T--){init(); solve();}
    return 0;
}