#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 100 + 5;
const int INF32 = 0x3f3f3f3f;

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

int N, M, sum[MAX_N][MAX_N][MAX_N], dis[MAX_N][MAX_N][MAX_N];
struct Node{
    int x, y, z;
    Node (int a = 0, int b = 0, int c = 0) : x(a), y(b), z(c) {}
};

void solve() {
    memset(sum, 0, sizeof sum);
    memset(dis, 0x3f, sizeof dis);
    scanf("%d%d", &N, &M);
    for (int i = 1; i <= M; i ++) {
        int a, b, c, d, e, f;
        scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f);
        d ++; e ++; f ++;
        sum[a][b][c] ++;
        sum[d][b][c] --;
        sum[a][e][c] --;
        sum[a][b][f] --;
        sum[a][e][f] ++;
        sum[d][b][f] ++;
        sum[d][e][c] ++;
        sum[d][e][f] --;
    }
    for (int i = 1; i <= N; i ++) {
        for (int j = 1; j <= N; j ++) {
            for (int k = 1; k <= N; k ++) {
                sum[i][j][k] += sum[i][j][k - 1];
            }
        }
    }
    for (int i = 1; i <= N; i ++) {
        for (int k = 1; k <= N; k ++) {
            for (int j = 1; j <= N; j ++) {
                sum[i][j][k] += sum[i][j - 1][k];
            }
        }
    }
    for (int j = 1; j <= N; j ++) {
        for (int k = 1; k <= N; k ++) {
            for (int i = 1; i <= N; i ++) {
                sum[i][j][k] += sum[i - 1][j][k];
            }
        }
    }
    int xs, ys, zs, xt, yt, zt;
    scanf("%d%d%d%d%d%d", &xs, &ys, &zs, &xt, &yt, &zt);
    if (sum[xs][ys][zs] || sum[xt][yt][zt]) {
        puts("-1"); return ;
    }
    queue <Node> q;
    q.push(Node(xs, ys, zs));
    dis[xs][ys][zs] = 0;
    while (!q.empty()) {
        auto [x, y, z] = q.front();
        q.pop();
        if (x == xt && y == yt && z == zt) break;
        int nd = dis[x][y][z] + 1;
        for (int k = 0; k < 6; k ++) {
            int nx = x + dx[k], ny = y + dy[k], nz = z + dz[k];
            if (nx > 0 && nx <= N && ny > 0 && ny <= N && nz > 0 && nz <= N && !sum[nx][ny][nz] && dis[nx][ny][nz] > nd) {
                dis[nx][ny][nz] = nd; q.push(Node(nx, ny, nz));
            }
        }
    }
    if (dis[xt][yt][zt] < INF32) printf("%d\n", dis[xt][yt][zt]);
    else puts("-1");
}

int main() {
    int T;
    scanf("%d", &T);
    while (T --) solve();
    return 0;
}