#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;

int t, n, m, k, ans = 7777; 
int a[7][7];

void dfs() {
	//中嘞，哥
	int tmp = 0;
	for(int i=1; i<=n; i++) {
		for(int j=1; j<=m; j++) {
			//对于这个点(i, j)，能不能跳ww
			if(i<=n-2&&a[i][j]&&a[i+1][j]&&!a[i+2][j]) {
				a[i][j] = a[i+1][j] = 0;
				a[i+2][j] = 1;
				dfs();
				a[i][j] = a[i+1][j] = 1;
				a[i+2][j] = 0;
			} 
			if(i>=3&&a[i][j]&&a[i-1][j]&&!a[i-2][j]) {
				a[i][j] = a[i-1][j] = 0;
				a[i-2][j] = 1;
				dfs();
				a[i][j] = a[i-1][j] = 1;
				a[i-2][j] = 0;
			}
			if(j>=3&&a[i][j]&&a[i][j-1]&&!a[i][j-2]) {
				a[i][j] = a[i][j-1] = 0;
				a[i][j-2] = 1;
				dfs();
				a[i][j] = a[i][j-1] = 1;
				a[i][j-2] = 0;
			}
			if(j<=m-2&&a[i][j]&&a[i][j+1]&&!a[i][j+2]) {
				a[i][j] = a[i][j+1] = 0;
				a[i][j+2] = 1;
				dfs();
				a[i][j] = a[i][j+1] = 1;
				a[i][j+2] = 0;
			}
			if(a[i][j]) tmp++;
		}
	}
	ans = min(ans, tmp);
}


int main() {
	//（顿住）
	scanf("%d", &t);
	while(t--) {
		ans = 7777;
		memset(a, 0, sizeof(a));
		scanf("%d%d%d", &n, &m, &k);
		for(int i=1; i<=k; i++) {
			int x, y; scanf("%d%d", &x, &y);
			a[x][y] = 1;
		}
		dfs();
		cout<<ans<<endl;
	} 
	return 0;
}