#include<bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
const int INF = 0x3f3f3f3f;

int n, m;
int dx[6] = {0, 0, 1, -1, 0, 0};
int dy[6] = {0, 0, 0, 0, 1, -1};
int dz[6] = {1, -1, 0, 0, 0, 0};
struct Node{
	int x, y, z;
};
queue<Node> que;
int dist[105][105][105], s[105][105][105];

int check(Node q) {
	int x = q.x, y = q.y, z = q.z;
	if (x < 1 || x > n || y < 1 || y > n || z < 1 || z > n) return 0;
	if (s[x][y][z] != 0) return 0;
	return 1;
}
void solve() {
	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];
	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][j - 1][k];
	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][j][k - 1];
}
signed main() {
#ifndef ONLINE_JUDGE
	freopen("a.in", "r", stdin);
#endif
	int Case;
	scanf("%d", &Case);
	while (Case --) {
		scanf("%d%d", &n, &m);
		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] = 0, dist[i][j][k] = INF;
		for (int i = 1; i <= m ; ++ i) {
			int l1, l2, l3, r1, r2, r3;
			scanf("%d%d%d%d%d%d", &l1, &l2, &l3, &r1, &r2, &r3);
			++ s[l1][l2][l3];

			-- s[r1 + 1][l2][l3];
			-- s[l1][r2 + 1][l3];
			-- s[l1][l2][r3 + 1];

			++ s[r1 + 1][r2 + 1][l3];
			++ s[l1][r2 + 1][r3 + 1];
			++ s[r1 + 1][l2][r3 + 1];

			-- s[r1 + 1][r2 + 1][r3 + 1];
		}
		solve();
		int X, Y, Z;
		scanf("%d%d%d", &X, &Y, &Z);
		que.push((Node){X, Y, Z}), dist[X][Y][Z] = 0;
		while (!que.empty()) {
			Node q = que.front(); que.pop();
			for (int i = 0; i < 6 ; ++ i) {
				Node p = (Node){q.x + dx[i], q.y + dy[i], q.z + dz[i]};
				if (check(p) && dist[p.x][p.y][p.z] == INF) 
					dist[p.x][p.y][p.z] = dist[q.x][q.y][q.z] + 1, que.push(p);
			}
		}
		scanf("%d%d%d", &X, &Y, &Z);
		if (dist[X][Y][Z] == INF) printf("-1\n");
		else printf("%d\n", dist[X][Y][Z]);
	}
	return 0;
}