#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second
 
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 104;
int a[N][N][N];
int d[N][N][N];

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};

int n;
bool ok(int x, int y, int z)
{
	return 1 <= x && x <= n && 1 <= y && y <= n && 1 <= z && z <= n;
}

void solve()
{
	FOR (i, 0, N) FOR (j, 0, N) FOR (k, 0, N)
	{
		a[i][j][k] = 0;
		d[i][j][k] = -1;
	}
	int m;
	cin >> n >> m;
	FOR (it, 0, m)
	{
		int x1, y1, z1, x2, y2, z2;
		cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2;
		if (x2 < x1)
			swap(x1, x2);
		if (y2 < y1)
			swap(y1, y2);
		if (z2 < z1)
			swap(z1, z2);
		x2++;
		y2++;
		z2++;
		FOR (mask, 0, 8)
		{
			int x = (mask & 1) ? x1 : x2;
			int y = (mask & 2) ? y1 : y2;
			int z = (mask & 4) ? z1 : z2;
			a[x][y][z] += (__builtin_popcount(mask) & 1) ? -1 : 1;
		}
	}
	FOR (x, 1, N)
		FOR (y, 0, N)
			FOR (z, 0, N)
				a[x][y][z] += a[x - 1][y][z];
				
	FOR (y, 1, N)
		FOR (x, 0, N)
			FOR (z, 0, N)
				a[x][y][z] += a[x][y - 1][z];
				
	FOR (z, 1, N)
		FOR (y, 0, N)
			FOR (x, 0, N)
				a[x][y][z] += a[x][y][z - 1];
				
	int x1, y1, z1;
	cin >> x1 >> y1 >> z1;
	d[x1][y1][z1] = 0;
	queue<tuple<int, int, int>> q;
	q.push({x1, y1, z1});
	while (!q.empty())
	{
		auto [x, y, z] = q.front();
		q.pop();
		
		FOR (i, 0, 6)
		{
			int nx = x + dx[i];
			int ny = y + dy[i];
			int nz = z + dz[i];
			if (ok(nx, ny, nz) && a[nx][ny][nz] == 0 && d[nx][ny][nz] == -1)
			{
				d[nx][ny][nz] = d[x][y][z] + 1;
				q.push({nx, ny, nz});
			}
		}
	}
	int x2, y2, z2;
	cin >> x2 >> y2 >> z2;
	cout << d[x2][y2][z2] << '\n';
}



int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	while (t--)
	{
		solve();
	}
	
	return 0;
}