#include<bits/stdc++.h>

using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int tests;
    cin >> tests;
    while (tests--) {
        int n, m;
        cin >> n >> m;
        vector dx(n + 1, vector(n + 1, vector(n + 1, 0)));
        for (int i = 0; i < m; ++i) {
            int lx, ly, lz, rx, ry, rz;
            cin >> lx >> ly >> lz >> rx >> ry >> rz;
            --lx, --ly, --lz;
            for (int mask = 0; mask < (1 << 3); ++mask) {
                int x = (~mask >> 0 & 1 ? lx : rx);
                int y = (~mask >> 1 & 1 ? ly : ry);
                int z = (~mask >> 2 & 1 ? lz : rz);
                dx[x][y][z] += (__builtin_popcount(mask) & 1 ? 1 : -1);
            }
        }
        for (int i = 0; i <= n; ++i) {
            for (int j = 0; j <= n; ++j) {
                for (int k = 0; k <= n; ++k) {
                    int res = 0;
                    for (int mask = 0; mask < (1 << 3); ++mask) {
                        int x = (~mask >> 0 & 1 ? i - 1 : i);
                        int y = (~mask >> 1 & 1 ? j - 1 : j);
                        int z = (~mask >> 2 & 1 ? k - 1 : k);
                        if (x >= 0 && y >= 0 && z >= 0) {
                            res += (__builtin_popcount(mask) & 1 ? -1 : 1) * dx[x][y][z];
                        }
                    }
                    dx[i][j][k] = res;
                }
            }
        }
        vector dist(n, vector(n, vector(n, -1)));
        int x1, y1, z1, x2, y2, z2;
        cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2;
        --x1, --y1, --z1, --x2, --y2, --z2;
        queue<tuple<int, int, int>> q;
        dist[x1][y1][z1] = 0;
        q.emplace(x1, y1, z1);
        while (q.size()) {
            auto [x, y, z] = q.front();
            q.pop();
            for (auto [a, b, c]: vector<tuple<int, int, int>>{
                    {x - 1, y,     z},
                    {x + 1, y,     z},
                    {x,     y - 1, z},
                    {x,     y + 1, z},
                    {x,     y,     z - 1},
                    {x,     y,     z + 1}
            }) {
                if (a < 0 || a >= n || b < 0 || b >= n || c < 0 || c >= n) continue;
                if (dist[a][b][c] != -1) continue;
                if (dx[a][b][c]) continue;
                dist[a][b][c] = dist[x][y][z] + 1;
                q.emplace(a, b, c);
            }
        }
        cout << dist[x2][y2][z2] << '\n';
    }
}