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

using i64 = long long;

void solve() {
	int n, m, k;
	cin >> n >> m >> k;
	vector<int> x(k), y(k);
	for (int i = 0; i < k; ++i) {
		cin >> x[i] >> y[i];
		--x[i], --y[i];
	}

	vector g(n, vector<bool>(m));
	for (int i = 0; i < k; ++i) {
		g[x[i]][y[i]] = true;
	}
	int ans = k;

	array dx = {1, 0, -1, 0};
	array dy = {0, -1, 0, 1};
	auto dfs = [&] (auto dfs, int a, int b, auto &g, auto &st) -> void {
		bool ok = false;
		for (auto &[x, y] : st) {

			for (int i = 0; i < 4; ++i) {
				int u1 = x + dx[i], v1 = y + dy[i];
				int u2 = x + 2 * dx[i], v2 = y + 2 * dy[i];
				if (u1 >= 0 && u1 < n && v1 >= 0 && v1 < m &&
					u2 >= 0 && u2 < n && v2 >= 0 && v2 < m &&
					g[u1][v1] && !g[u2][v2]) {
					ok = true;

					auto t = g;
					t[u1][v1] = false;
					t[u2][v2] = true;
					t[x][y] = false;

					// g[u1][v1] = false;
					// g[u2][v2] = true;
					// g[a][b] = false;
					auto p = st;
					p.erase({x, y});
					p.erase({u1, v1});
					p.insert({u2, v2});

					// st.erase({a, b});
					// st.erase({u1, v1});
					// st.insert({u2, v2});
					dfs(dfs, u2, v2, t, p);
				}
			}

		}
		
		if (!ok) {
			ans = min(ans, (int)st.size());
		}
		return;
	};

	set<array<int, 2>> st;
	for (int i = 0; i < k; ++i) {
		st.insert({x[i], y[i]});
	}
	for (auto &[x, y] : st) {
		dfs(dfs, x, y, g, st);
	}
	cout << ans << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}