#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

#define DEBUG_VAR(x) { cerr << "* "#x" = " << x << endl; }
#define DEBUG_ARR(arr, l, r) { \ 
    cerr << "* "#arr"[" << l << ", " << r << "]:"; \
    for(auto it = l, itr = r; it <= itr; it++) \
        cerr << arr[it] << ", "; \
    cerr << endl; \
}
#define DEBUG_FMT(...) { cerr << "* "; fprintf(stderr, __VA_ARGS__); }
#define DEBUG_HERE { DEBUG_FMT("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__); } 

#define y1 y_1

using namespace std;
using LL = long long;
using ULL = unsigned long long;

const int N = 105, M = 1e6 + 5;
const int INF = 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;
int a[N][N][N];

int dis[N][N][N];
bool vis[N][N][N];

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

void bfs()
{
    queue<tuple<int, int, int>> q;

    dis[sx][sy][sz] = 0;
    vis[sx][sy][sz] = true;
    q.emplace(sx, sy, sz);

    while(q.size()) {
        auto [x, y, z] = q.front(); q.pop();

        for(int i = 0; i < 6; i++) {
            int nx = x + dx[i],  ny = y + dy[i], nz = z + dz[i];
            
            if(nx < 1 || nx > n || ny < 1 || ny > n || nz < 1 || nz > n) 
                continue;
            if(vis[nx][ny][nz])
                continue;
            if(a[nx][ny][nz]) continue;
            
            dis[nx][ny][nz] = dis[x][y][z] + 1;
            vis[nx][ny][nz] = true;
            q.emplace(nx, ny, nz);
        }
    }
}

void solve()
{
    cin >> n >> m;

    for(int i = 0; i <= n + 1; i++) {
        for(int j = 0; j <= n + 1; j++) {
            for(int k = 0; k <= n + 1; k++) {
                a[i][j][k] = 0;
                dis[i][j][k] = INF;
                vis[i][j][k] = false;
            }
        }
    }

    for(int i = 1; i <= m; i++) {
        int x1, x2, y1, y2, z1, z2;
        cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2;

        a[x1][y1][z1]++;
        a[x2 + 1][y1][z1]--;
        a[x1][y2 + 1][z1]--;
        a[x1][y1][z2 + 1]--;
        a[x2 + 1][y2 + 1][z1]++;
        a[x2 + 1][y1][z2 + 1]++;
        a[x1][y2 + 1][z2 + 1]++;
        a[x2 + 1][y2 + 1][z2 + 1]--;
    }

    for(int i = 1; i <= n; i++) {
        for(int j = 1; j <= n; j++) {
            for(int k = 1; k <= n; k++) {
                a[i][j][k] += 
                a[i - 1][j][k]
                +a[i][j - 1][k]
                +a[i][j][k - 1]
                -a[i - 1][j - 1][k]
                -a[i - 1][j][k - 1]
                -a[i][j - 1][k - 1]
                +a[i - 1][j - 1][k - 1];
                // DEBUG_FMT("a(%d, %d, %d) = %d\n", i, j, k, a[i][j][k]);
            }
        }
    }

    cin >> sx >> sy >> sz >> tx >> ty >> tz;
    
    bfs();

    if(dis[tx][ty][tz] == INF) {
        cout << "-1" << endl;
    } else {
        cout << dis[tx][ty][tz] << endl;
    }
}

int main()
{
    // freopen("1.in", "r", stdin);
    ios::sync_with_stdio(false); cin.tie(nullptr);

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

    return 0;
}