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

inline ll rd() {
	ll x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

const int N = 101;

int sum[N][N][N], id[N][N][N], dis[N * N * N];

vector<int> e[N * N * N];

const int dx[6] = {1, -1, 0, 0, 0, 0};
const int dy[6] = {0, 0, 1, -1, 0, 0};
const int dz[6] = {0, 0, 0, 0, 1, -1};

void work() {
	int n = rd(), m = rd();
	memset(sum, 0, sizeof(sum));
	int tot = 0;
	rep(i, 1, n) rep(j, 1, n) rep(k, 1, n) {
		id[i][j][k] = ++tot; e[tot].clear(); dis[tot] = 1e9;
	}
	rep(i, 1, m) {
		int a = rd(), b = rd(), c = rd();
		int d = rd(), e = rd(), f = rd();
		++sum[a][b][c];
		--sum[d + 1][b][c];
		--sum[a][e + 1][c];
		--sum[a][b][f + 1];
		++sum[d + 1][e + 1][c];
		++sum[d + 1][b][f + 1];
		++sum[a][e + 1][f + 1];
		--sum[d + 1][e + 1][f + 1];
	}
	rep(i, 1, n) rep(j, 1, n) rep(k, 1, n) {
		sum[i][j][k] += sum[i - 1][j - 1][k - 1] 
					  - sum[i][j - 1][k - 1]
					  - sum[i - 1][j][k - 1]
					  - sum[i - 1][j - 1][k]
					  + sum[i][j][k - 1]
					  + sum[i][j - 1][k]
					  + sum[i - 1][j][k];
		//printf("sum[%d][%d][%d] = %d\n", i, j, k, sum[i][j][k]);
	}
	rep(x, 1, n) rep(y, 1, n) rep(z, 1, n) if (!sum[x][y][z]) {
		rep(d, 0, 5) {
			int tx = x + dx[d];
			int ty = y + dy[d];
			int tz = z + dz[d];
			if (tx < 1 || tx > n || ty < 1 || ty > n || tz < 1 || tz > n) continue;
			if (sum[tx][ty][tz]) continue;
			e[id[x][y][z]].eb(id[tx][ty][tz]);
		}	
	}
	int x = rd(), y = rd(), z = rd();
	int s = id[x][y][z];
	x = rd(); y = rd(); z = rd();
	int t = id[x][y][z];
	dis[s] = 0;
	queue<int> q;
	q.push(s);
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (auto v : e[u]) 
			if (dis[v] > dis[u] + 1) {
				dis[v] = dis[u] + 1;
				q.push(v);
			}
	}	
	printf("%d\n", dis[t] == 1e9 ? -1 : dis[t]);
}

int main() {
	per(t, rd(), 1) work();
	return 0;
}