#include <bits/stdc++.h>
#define N 1000005
#define mod 1000000007
using i64 = long long;
using namespace std;

int n, m, k, s1, t1, s2, t2, vis[31][31];
vector<array<int, 4>> block;
int dir[4][2] = {{0, -2}, {0, 2}, {2, 0}, {2, -2}};
bool dfs(int curx, int cury, int sta)
{
    if (tie(curx, cury) == tie(s2, t2))
        return true;
    vis[curx][cury] = 1;
    for (int j = 0; j < 4; j++)
    {
        int cx = curx + dir[j][0];
        int cy = cury + dir[j][1];
        if (cx < 0 || cy < 0)
            continue;
        if (cx > n || cy > m)
            continue;
        if (vis[cx][cy])
            continue;
        bool is = 1;
        for (int i = 0; i < k && is; i++)
        {
            if (sta >> i & 1)
            {
                if (block[i][0] == block[i][2])
                {
                    if ((block[i][0] - curx) * (block[i][0] - cx) == -1)
                        if (min(block[i][1], block[i][3]) <= cy && max(block[i][1], block[i][3]) >= cy)
                            is = 0;
                }
                else
                {
                    if ((block[i][1] - cury) * (block[i][1] - cy) == -1)
                        if (min(block[i][0], block[i][2]) <= cx && max(block[i][0], block[i][2]) >= cx)
                            is = 0;
                }
            }
        }
        if (is && dfs(cx, cy, sta))
            return true;
    }
    return false;
}
int popcount(int x)
{
    int res = 0;
    while (x)
    {
        res += x & 1;
        x >>= 1;
    }
    return res;
}
void solve()
{
    cin >> n >> m >> k;
    n *= 2, m *= 2;
    cin >> s1 >> t1 >> s2 >> t2;
    s1 = 2 * s1 + 1;
    t1 = 2 * t1 + 1;
    s2 = 2 * s2 + 1;
    t2 = 2 * t2 + 1;
    block.clear();
    array<int, 4> f;
    for (int i = 1; i <= k; i++)
    {
        cin >> f[0] >> f[1] >> f[2] >> f[3];
        for (int &j : f)
            j *= 2;
        block.push_back(f);
    }
    int ans = k;
    for (int s = 0; s < (1 << k); s++)
    {
        memset(vis, 0, sizeof(vis));
        if (dfs(s1, t1, s))
            ans = min(ans, popcount((1 << k) - 1 - s));
    }
    cout << ans << '\n';
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}