#include<bits/stdc++.h>
using namespace std;

const int N=111;

int T,n,m;

int s[N][N][N],ds[N][N][N];

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 main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>T;
    while(T--)
    {
        cin>>n>>m;
        memset(s,0,sizeof(s));
        for(int i=1;i<=m;i++)
        {
            int a,b,c,d,e,f;
            cin>>a>>b>>c>>d>>e>>f;
            s[a][b][c]++;
            s[d+1][b][c]--;
            s[a][e+1][c]--;
            s[a][b][f+1]--;
            s[d+1][e+1][c]++;
            s[a][e+1][f+1]++;
            s[d+1][b][f+1]++;
            s[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]=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]+s[i][j][k];
                }
        queue<tuple<int,int,int> >q;
        int a,b,c,d,e,f;
        cin>>a>>b>>c>>d>>e>>f;
        if(s[a][b][c]||s[d][e][f])
        {
            cout<<"-1\n";
            continue;
        }
        for(int i=1;i<=n;i++)
            for(int j=1;j<=n;j++)
                for(int k=1;k<=n;k++)
                    ds[i][j][k]=-1;
        ds[a][b][c]=0;
        q.push({a,b,c});
        while(!q.empty())
        {
            auto [x,y,z]=q.front();
            q.pop();
            for(int w=0;w<6;w++)
            {
                int tx=dx[w]+x,ty=dy[w]+y,tz=dz[w]+z;
                if(tx<1||tx>n||ty<1||ty>n||tz<1||tz>n||s[tx][ty][tz]||ds[tx][ty][tz]!=-1)
                    continue;
                ds[tx][ty][tz]=ds[x][y][z]+1;
                q.push({tx,ty,tz});
            }
        }
        cout<<ds[d][e][f]<<"\n";
    }
}