#include<bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define Mp make_pair
#define PR pair<int, pair<int,int> >
#define fi first
#define se second
using namespace std;

int rd() {
	int r = 0; bool w = false; char ch = getchar();
	while( ch < '0' || ch > '9' ) w = !(ch^45), ch = getchar();
	while( ch >= '0' && ch <= '9' ) r = (r<<1) + (r<<3) + (ch^48), ch = getchar();
	return w ? -r : r;
}

#define MAXN 100
int n, m;
int r[MAXN+5][MAXN+5][MAXN+5];
int vis[MAXN+5][MAXN+5][MAXN+5];
int sx, sy, sz, tx, ty, tz;
queue<pair<int, pair<int,int> > > q;
int dx[] = {0, 1, -1, 0, 0, 0, 0};
int dy[] = {0, 0, 0, 1, -1, 0, 0};
int dz[] = {0, 0, 0, 0, 0, 1, -1};
void solve() {
	n = rd(), m = rd();
	memset(r,0,sizeof(r));
	memset(vis,-1,sizeof(vis));
	FOR(i,1,m) {
		int a = rd(), b = rd(),
			c = rd(), d = rd(),
			e = rd(), f = rd();
//		r[d][e][f] += 1;
//		r[d][e][c-1] -= 1;
//		r[a-1][e][f] -= 1;
//		r[d][b-1][f] -= 1;
//		r[a-1][b-1][f] += 1;
//		r[a-1][e][c-1] += 1;
//		r[d][b-1][c-1] += 1;
//		r[a-1][b-1][c-1] -= 1;
		r[a][b][c] += 1;
		r[a][b][f+1] -= 1;
		r[a][e+1][c] -= 1;
		r[d+1][b][c] -= 1;
		r[a][e+1][f+1] += 1;
		r[d+1][b][f+1] += 1;
		r[d+1][e+1][c] += 1;
		r[d+1][e+1][f+1] -= 1;
	}
	
	FOR(i,1,n) FOR(j,1,n) FOR(k,1,n)
		r[i][j][k] += r[i-1][j][k] + r[i][j-1][k] + r[i][j][k-1] 
					- r[i-1][j-1][k] - r[i-1][j][k-1] - r[i][j-1][k-1]
					+ r[i-1][j-1][k-1];
//	FOR(i,1,n) FOR(j,1,n) FOR(k,1,n) {
//		printf("%d %d %d:%d\n", i, j, k, r[i][j][k]);
//	}
	sx = rd(), sy = rd(), sz = rd();
	tx = rd(), ty = rd(), tz = rd();
	q.push(Mp(sx, Mp(sy, sz)));
	vis[sx][sy][sz] = 0;
	while( !q.empty() ) {
		PR u = q.front(); q.pop();
//		 printf("%d %d %d\n", u.fi, u.se.fi, u.se.se);
		FOR(d,1,6) {
			int ax = dx[d] + u.fi, ay = dy[d] + u.se.fi, az = dz[d] + u.se.se;
			if( ax <= 0 || ax > n || ay <= 0 || ay > n || az <= 0 || az > n || vis[ax][ay][az] != -1 || r[ax][ay][az] ) continue;
			vis[ax][ay][az] = vis[u.fi][u.se.fi][u.se.se] + 1;
			q.push(Mp(ax, Mp(ay, az)));
		}
	}
//	FOR(i,0,n+1) FOR(j,0,n+1) FOR(k,0,n+1) {
//		printf("%d %d %d:%d\n", i, j, k, vis[i][j][k]);
//	}
	if( vis[tx][ty][tz] == -1 ) puts("-1");
	else printf("%d\n", vis[tx][ty][tz]);
}

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