#include<bits/stdc++.h>
#define For(i,j,k) for(int i=(j);i<=(k);i++)
#define foR(i,j,k) for(int i=(j);i>=(k);i--) 
#define vi vector<int>
#define pb push_back
#define pii pair<int,int> 
#define mkp make_pair
#define SZ(x) ((int)x.size())

using namespace std;
inline int read() {
	char c;int res=0;bool flag=0;
	while(c=getchar(),c<48)(c=='-')&&(flag=1);
	do res=(res<<3)+(res<<1)+(c^48);
	while(c=getchar(),c>47);
	flag&&(res=-res); return res; 
}
const int MN=105; 
int n,vis[MN][MN][MN],m,sum[MN][MN][MN]; 
int dx[6]={1,-1,0,0,0,0};
int dy[6]={0,0,1,-1,0,0};
int dz[6]={0,0,0,0,1,-1}; 
struct ele {
	int x,y,z; 
	ele(){} ele(int X,int Y,int Z):x(X),y(Y),z(Z){}	
}; 
void works() {
	n=read(),m=read();
	memset(vis,0,sizeof(vis)); memset(sum,0,sizeof(sum)); 
	For(i,1,n) For(j,1,n) For(k,1,n) vis[i][j][k]=-1;   
	For(i,1,m) {
		int x1=read(),y1=read(),z1=read(),x2=read(),y2=read(),z2=read();
		For(x,x1,x2) {
			sum[x][y1][z1]++; 
			sum[x][y1][z2+1]--; 
			sum[x][y2+1][z1]--; 
			sum[x][y2+1][z2+1]++; 
		}	
	}
	For(x,1,n) {
		For(y,1,n) For(z,1,n) {
			sum[x][y][z]+=sum[x][y-1][z]+sum[x][y][z-1]-sum[x][y-1][z-1]; 
			if(sum[x][y][z]) vis[x][y][z]=1; 	
		}
	}
	int sx=read(),sy=read(),sz=read(),ex=read(),ey=read(),ez=read();
	queue<ele>q; q.push(ele(sx,sy,sz)); vis[sx][sy][sz]=0; 
	while(SZ(q)) {
		ele it=q.front(); q.pop();
		int x=it.x,y=it.y,z=it.z; 
		For(i,0,5) {
			int nx=it.x+dx[i],ny=it.y+dy[i],nz=it.z+dz[i]; 
			if(vis[nx][ny][nz]!=-1) continue; 
			vis[nx][ny][nz]=vis[x][y][z]+1; 
			
			q.push(ele(nx,ny,nz)); 	
		}
	}
	if(vis[ex][ey][ez]!=-1) printf("%d\n",vis[ex][ey][ez]); 
	else printf("-1\n"); 
}
signed main() {
	#ifdef wasa855
		freopen("pro.in","r",stdin); 
		freopen("pro.out","w",stdout); 
	#endif
	int T=read(); 
	while(T--) {
		works(); 	
	}
	return 0; 	
}