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

void solve() {

	int n,m,k;
	cin >> n >> m >> k;

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

	int ans = k;
	function<void(int , vector<vector<int>>&)> dfs = [&] (int num ,vector<vector<int>>&a) {
		ans = min(ans , num);
		if (num == 1) {
			return;
		}
		for (int i = 0 ; i < n ; ++i) {
			for (int j = 0 ; j < m ; ++j) {
				if (a[i][j] == 1) {
					
					//up
					if (i - 2 >= 0 && a[i - 1][j] && !a[i - 2][j]) {
						a[i][j] = 0;
						a[i - 1][j] = 0;
						a[i - 2][j] = 1;
						dfs(num - 1 , a);
						a[i][j] = 1;
						a[i - 1][j] = 1;
						a[i - 2][j] = 0;
					}
					//down
					if (i + 2 <= n - 1 && a[i + 1][j] && !a[i + 2][j]) {
						a[i][j] = 0;
						a[i + 1][j] = 0;
						a[i + 2][j] = 1;
						dfs(num - 1 , a);
						a[i][j] = 1;
						a[i + 1][j] = 1;
						a[i + 2][j] = 0;
					}
					//left
					if (j - 2 >= 0 && a[i][j - 1] && !a[i][j - 2]) {
						a[i][j] = 0;
						a[i][j - 1] = 0;
						a[i][j - 2] = 1;
						dfs(num - 1 , a);
						a[i][j] = 1;
						a[i][j - 1] = 1;
						a[i][j - 2] = 0;
					}
					//right
					if (j + 2 <= m - 1 && a[i][j + 1] && !a[i][j + 2]) {
						a[i][j] = 0;
						a[i][j + 1] = 0;
						a[i][j + 2] = 1;
						dfs(num - 1 , a);
						a[i][j] = 1;
						a[i][j + 1] = 1;
						a[i][j + 2] = 0;
					}
				}
			}
		}
	};

	dfs(k , a);

	cout << ans << "\n";
}

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

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

	return 0;
}