#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll read() {
	   ll x = 0,f = 1;
	   char ch = getchar();
	   while(ch < '0' ||ch > '9') {
			if(ch == '-') f = -1;
			ch = getchar();
	   }
	   while(ch >= '0' && ch <= '9') {
			x = (x << 1) + (x << 3) + (ch ^ '0');
			ch = getchar();
	   }
	   return x * f;
}
const int N = 7;
int t; int n, m, k;
bool vis[N][N]; int ans;
int mov[4][2] = {{-1,0},{0,1},{1,0},{0,-1}};
void dfs(int st) {
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (vis[i][j]) {
				for (int nw = 0; nw < 4; nw++) {
					int xx = i + mov[nw][0], yy = j + mov[nw][1];
					int tox = xx + mov[nw][0], toy = yy + mov[nw][1];
					if (tox >= 1 && tox <= n && toy >= 1 && toy <= m) {
						if (vis[xx][yy] && !vis[tox][toy]) {
							vis[tox][toy] = 1; vis[xx][yy] = vis[i][j] = 0;
							dfs(st + 1);
							vis[tox][toy] = 0; vis[xx][yy] = vis[i][j] = 1;
						}
					}
				}
			}
		}
	}
	ans = max(ans, st);
	return;
}
int main() {
	t = read();
	while (t--) {
		n = read(), m = read(), k = read();
		memset(vis, 0, sizeof vis); ans = 0;
		for (int i = 1; i <= k; i++) {
			int a = read(), b = read();
			vis[a][b] = 1;
		}
		dfs(0);
		printf("%d\n",k - ans);
	}	
	return 0;
}