#include <bits/stdc++.h>

using namespace std;

const int SZN = 100 + 5;

int n, m;
int mk[SZN][SZN][SZN];
int dist[SZN][SZN][SZN];

const int DX[] = {1, -1, 0, 0, 0, 0};
const int DY[] = {0, 0, 1, -1, 0, 0};
const int DZ[] = {0, 0, 0, 0, 1, -1};

bool leq(int a, int b, int c) {
    return a <= b && b <= c;
}

bool check(int x, int y, int z) {
    return leq(1, x, n) && leq(1, y, n) && leq(1, z, n) && !mk[x][y][z];
}

int main(void) {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d", &n, &m);
        for (int i = 0; i <= n; ++i) {
            for (int j = 0; j <= n; ++j) {
                for (int k = 0; k <= n; ++k) {
                    mk[i][j][k] = 0;
                    dist[i][j][k] = -1;
                }
            }
        }
        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);
            for (int x = a; x <= d; ++x) {
                ++mk[x][b][c];
                --mk[x][e + 1][c];
                --mk[x][b][f + 1];
                ++mk[x][e + 1][f + 1];
            }
        }
        for (int i = 1; i <= n; ++i) {
            for (int j = 1; j <= n; ++j) {
                for (int k = 1; k <= n; ++k) {
                    mk[i][j][k] = mk[i][j][k] + mk[i][j - 1][k] +
                                  mk[i][j][k - 1] - mk[i][j - 1][k - 1];
                }
            }
        }
        int x1, y1, z1, x2, y2, z2;
        scanf("%d%d%d%d%d%d", &x1, &y1, &z1, &x2, &y2, &z2);
        if (!check(x1, y1, z1) || !check(x2, y2, z2)) {
            puts("-1");
            continue;
        }
        queue<tuple<int, int, int>> que;
        que.emplace(x1, y1, z1);
        dist[x1][y1][z1] = 0;
        while (!que.empty()) {
            auto [x, y, z] = que.front();
            que.pop();
            for (int i = 0; i < 6; ++i) {
                int nx = x + DX[i], ny = y + DY[i], nz = z + DZ[i];
                if (check(nx, ny, nz) && dist[nx][ny][nz] == -1) {
                    dist[nx][ny][nz] = dist[x][y][z] + 1;
                    que.emplace(nx, ny, nz);
                }
            }
        }
        printf("%d\n", dist[x2][y2][z2]);
    }
    return 0;
}