#include <bits/stdc++.h>
using namespace std;

#define int long long

bool vis[15][15];
vector<int> dx = {-1, 1, 0, 0};
vector<int> dy = {0, 0, -1, 1};

bool ok(int n, int m, int xs, int ys, int xt, int yt, vector<tuple<int, int, int, int>> wall) {
	memset(vis, 0, sizeof(vis));

	queue<pair<int, int>> q;
	vis[xs][ys] = 1;
	q.push({xs, ys});

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

		for (int d = 0; d < 4; d++) {
			int nx = x + dx[d];
			int ny = y + dy[d];

			if (nx < 0 || ny < 0 || nx >= n || ny >= m) continue;
			if (vis[nx][ny]) continue;
			bool can = 1;
			for (auto [x1, y1, x2, y2]: wall) {
				if (x != nx) {
					if (y1 == y2) continue;

					bool inside = 0;
					if (y >= min(y1, y2) && y < max(y1, y2)) inside = 1;
					bool side1 = (x >= x1);
					bool side2 = (nx >= x1);

					if (inside && side1 != side2) can = 0;
				}
				if (y != ny) {
					if (x1 == x2) continue;

					bool inside = 0;
					if (x >= min(x1, x2) && x < max(x1, x2)) inside = 1;
					bool side1 = (y >= y1);
					bool side2 = (ny >= y1);

					if (inside && side1 != side2) can = 0;
				}
			}
			if (can) {
				vis[nx][ny] = 1;
				q.push({nx, ny});
			}
		}
	}
	return vis[xt][yt];
}

void solve() {
	int n, m, k; cin >> n >> m >> k;
	int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;
	vector<tuple<int, int, int, int>> walls;
	for (int i = 0; i < k; i++) {
		int a, b, c, d; cin >> a >> b >> c >> d;
		walls.emplace_back(a, b, c, d);
	}

	int ans = k;
	for (int i = 0; i < (1 << k); i++) {
		vector<tuple<int, int, int, int>> wall;
		for (int j = 0; j < k; j++) {
			if (i & (1 << j)) {
				wall.push_back(walls[j]);
			}
		}

		if (ok(n, m, x1, y1, x2, y2, wall))  {
			ans = min(ans, (int)walls.size() - (int)wall.size());
		}
	}
	cout << ans << '\n';
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0); 
	
	int t; cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}