#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;

struct wall
{
	int id, st, fi;
};

int n, m, k, start, finish;
queue<int> q;
wall hor[20], ver[20];
bool vis[15 * 15 + 5];

vector<int> g[15 * 15+5];

void mk(int x)
{
	bool hwall[20] = {};
	for(int i=0; i<n; i++)
	{
		for(int j=0; j<m; j++)
			hwall[j] = 0;
		for(int j=0; j<k; j++)
		{
			if(!((x>>j) & 1))
				continue;
			if(ver[j].id == -1)
				continue;
			if(ver[j].st <= i && i < ver[j].fi)
				hwall[ver[j].id] = 1;
		}
		for(int j=1; j<m; j++)
		{
			if(hwall[j])
				continue;
			int one = i * m + (j-1), two = i * m + j;
			g[one].push_back(two), g[two].push_back(one);
		}
	}

	for(int j=0; j<m; j++)
	{
		for(int i=0; i<n; i++)
			hwall[i] = 0;
		for(int i=0; i<k; i++)
		{
			if(!((x >> i) & 1))
				continue;
			if(hor[i].id == -1)
				continue;
			if(hor[i].st <= j && j < hor[i].fi)
				hwall[i] = 1;
		}
		for(int i=1; i<n; i++)
		{
			if(hwall[i])
				continue;
			int one = (i-1)*m + j, two = i*m + j;
			g[one].push_back(two), g[two].push_back(one);
		}
	}
}

bool bfs(int rm)
{
	memset(vis, 0, sizeof(vis));
	fill(g, g+n*m, vector<int>());

	mk(rm);
	q.push(start);
	vis[start] = 1;

	while(q.size())
	{
		int now = q.front();
		q.pop();
		for(int i: g[now])
		{
			if(!vis[i])
			{
				vis[i] = 1;
				q.push(i);
			}
		}
	}

	return vis[finish];
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int t;
	cin >> t;
	while(t--)
	{
		cin >> n >> m >> k;
		int w, x, y, z;
		cin >> w >> x >> y >> z;
		start = w * m + x, finish = y * m + z;
		for(int i=0; i<k; i++)
		{
			cin >> w >> x >> y >> z;
			if(w == y)
			{
				hor[i] = {w, x, z};
				ver[i] = {-1, -1, -1};
			}
			else
			{
				ver[i] = {x, w, y};
				hor[i] = {-1, -1, -1};
			}
		}

		int ans = k;
		for(int i=0; i<(1<<k); i++)
		{
			bool now = bfs(i);
			if(now)
				ans = min(ans, k - __builtin_popcount(i));
		}
		cout << ans << "\n";
	}
}