#include<bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using i128 = __int128_t;

struct Node {
    int x, y, z;
};

constexpr int N = 6;
constexpr int INF = 1e9;
constexpr int dx[N] = { 1, -1, 0, 0, 0, 0 };
constexpr int dy[N] = { 0, 0, 1, -1, 0, 0 };
constexpr int dz[N] = { 0, 0, 0, 0, 1, -1 };

void solve() {
    int n, m;
    cin >> n >> m;
    vector field(n + 2, vector(n + 2, vector(n + 2, 0)));
    for (int i = 1; i <= m; i++) {
        int a, b, c, d, e, f;
        cin >> a >> b >> c >> d >> e >> f;
        for (int j = a; j <= d; j++) {
            for (int k = b; k <= e; k++) {
                field[j][k][c] += 1;
                field[j][k][f + 1] -= 1;
            }
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            for (int k = 1; k <= n; k++) {
                field[i][j][k] += field[i][j][k - 1];
            }
        }
    }

    int sx, sy, sz, tx, ty, tz;
    cin >> sx >> sy >> sz >> tx >> ty >> tz;

    if (field[sx][sy][sz] || field[tx][ty][tz]) {
        cout << -1 << "\n";
        return;
    }

    queue<Node> q;
    q.push({ sx, sy, sz });
    vector dis(n + 2, vector(n + 2, vector(n + 2, INF)));
    dis[sx][sy][sz] = 0;
    while (!q.empty()) {
        auto [ux, uy, uz] = q.front();
        q.pop();
        for (int i = 0; i < N; i++) {
            int cx = ux + dx[i];
            int cy = uy + dy[i];
            int cz = uz + dz[i];
            if (1 <= cx && cx <= n && 1 <= cy && cy <= n && 1 <= cz && cz <= n && field[cx][cy][cz] == 0) {
                if (dis[cx][cy][cz] > dis[ux][uy][uz] + 1) {
                    dis[cx][cy][cz] = dis[ux][uy][uz] + 1;
                    q.push({ cx, cy, cz });
                }
            }
        }
    }

    cout << (dis[tx][ty][tz] == INF ? -1 : dis[tx][ty][tz]) << "\n";
}

/*
3
3 0
1 1 1 3 3 3
3 1
2 1 1 2 3 3
1 1 1 3 3 3
3 3
2 1 1 2 2 3
1 1 2 2 3 2
1 2 2 3 3 2
1 1 1 1 1 3

*/

int main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);

    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}