#include <bits/stdc++.h>
using namespace std;
static constexpr int maxn = 16;

int vis[maxn][maxn], visc;
int a[2][maxn][maxn];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int t; cin >> t;
    while (t--) {
        int n, m, k; cin >> n >> m >> k;
        int xs, ys, xt, yt;
        cin >> xs >> ys >> xt >> yt;
        vector<pair<pair<int, int>, pair<int, int>>> b(k);
        for (auto &[lhs, rhs] : b) {
            cin >> lhs.first >> lhs.second;
            cin >> rhs.first >> rhs.second;
        }

        auto gao = [&](const pair<pair<int, int>, pair<int, int>> &l){
            const auto &[lhs, rhs] = l;
            if (lhs.first == rhs.first) {
                const auto &[p, q] = minmax(lhs.second, rhs.second);
                for (int i = p; i < q; ++i)
                    a[0][lhs.first][i] = visc;
            } else {
                const auto &[p, q] = minmax(lhs.first, rhs.first);
                for (int i = p; i < q; ++i)
                    a[1][i][lhs.second] = visc;
            }
        };

        auto good = [&](int s) {
            ++visc;
            for (int i = 0; i < k; ++i) {
                if (!((s >> i) & 1))
                    gao(b[i]);
            }
            queue<pair<int, int>> bfs;
            bfs.emplace(xs, ys);
            vis[xs][ys] = visc;
            while (not bfs.empty()) {
                auto [x, y] = bfs.front();
                bfs.pop();
                if (int nx = x, ny = y + 1; ny < m) {
                    if (vis[nx][ny] != visc and a[1][nx][ny] != visc) {
                        vis[nx][ny] = visc;
                        bfs.emplace(nx, ny);
                    }
                } 
                if (int nx = x, ny = y - 1; ny >= 0) {
                    if (vis[nx][ny] != visc and a[1][nx][ny] != visc) {
                        vis[nx][ny] = visc;
                        bfs.emplace(nx, ny);
                    }
                } 
                if (int nx = x + 1, ny = y; nx < n) {
                    if (vis[nx][ny] != visc and a[0][nx][ny] != visc) {
                        vis[nx][ny] = visc;
                        bfs.emplace(nx, ny);
                    }
                } 
                if (int nx = x - 1, ny = y; nx >= 0) {
                    if (vis[nx][ny] != visc and a[0][nx][ny] != visc) {
                        vis[nx][ny] = visc;
                        bfs.emplace(nx, ny);
                    }
                } 
            }
            return vis[xt][yt] == visc;
        };

        int ans = k;
        const int S = 1 << k;
        for (int s = 0; s < S; ++s) {
            if (good(s)) ans = min(ans, __builtin_popcount(s));
        }
        cout << ans << '\n';
    }
    return 0;
}