#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m, k;
int dfs(bool g[][6], int k) {
	
	int res = k;
	
	for(int i = 0; i < n - 1; i++) {
		for(int j = 0; j < m - 1; j++) {
			if(g[i][j] == 0) continue;
			if(g[i + 1][j] == 1) {
				if(i - 1 >= 0 && i - 1 < n && g[i - 1][j] == 0) {
					g[i][j] = 0;
					g[i + 1][j] = 0;
					g[i - 1][j] = 1;
					res = std::min(res, dfs(g, k - 1));
					g[i][j] = 1;
					g[i + 1][j] = 1;
					g[i - 1][j] = 0;
				}
				if(i + 2 >= 0 && i + 2 < n && g[i + 2][j] == 0) {
					g[i][j] = 0;
					g[i + 1][j] = 0;
					g[i + 2][j] = 1;
					res = std::min(res, dfs(g, k - 1));
					g[i][j] = 1;
					g[i + 1][j] = 1;
					g[i + 2][j] = 0;
				}
			}
			
			if(g[i][j + 1] == 1) {
				if(j - 1 >= 0 && j - 1 < m && g[i][j - 1] == 0) {
					g[i][j] = 0;
					g[i][j + 1] = 0;
					g[i][j  -1] = 1;
					res = std::min(res, dfs(g, k - 1));
					g[i][j] = 1;
					g[i][j + 1] = 1;
					g[i][j - 1] = 0;
				}
				if(j + 2 >= 0 && j + 2 < m && g[i][j + 2] == 0) {
					g[i][j] = 0;
					g[i][j + 1] = 0;
					g[i][j + 2] = 1;
					res = std::min(res, dfs(g, k - 1));
					g[i][j] = 1;
					g[i][j + 1] = 1;
					g[i][j + 2] = 0;
				}
			}
		}
	}
	
	
	return res;
}
void solve(){
	std::cin >> n >> m >> k;
	bool g[6][6]{0};
	
	int x, y;
	for(int i = 0; i < k; i++) {
		std::cin >> x >> y;
		g[x - 1][y - 1] = 1;
	}
	std::cout << dfs(g, k) << '\n';
}
int main()
{
	int t = 1;
	std::cin >> t;
	while(t--) solve();
}