// Problem: P9700 [GDCPC2023] Peg Solitaire
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P9700
// Memory Limit: 1 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

int n, m, K;
bool vis[9][9];

void solve() {
	scanf("%d%d%d", &n, &m, &K);
	vector<pii> vc;
	while (K--) {
		int x, y;
		scanf("%d%d", &x, &y);
		vc.pb(x, y);
	}
	queue< vector<pii> > q;
	q.push(vc);
	set< vector<pii> > S;
	S.insert(vc);
	int ans = 99;
	while (q.size()) {
		vector<pii> u = q.front();
		q.pop();
		mems(vis, 0);
		ans = min(ans, (int)u.size());
		for (pii p : u) {
			vis[p.fst][p.scd] = 1;
		}
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= m; ++j) {
				if (i >= 3 && vis[i][j] && vis[i - 1][j] && !vis[i - 2][j]) {
					vis[i][j] ^= 1;
					vis[i - 1][j] ^= 1;
					vis[i - 2][j] ^= 1;
					vector<pii> v;
					for (int x = 1; x <= n; ++x) {
						for (int y = 1; y <= m; ++y) {
							if (vis[x][y]) {
								v.pb(x, y);
							}
						}
					}
					if (S.find(v) == S.end()) {
						S.insert(v);
						q.push(v);
					}
					vis[i][j] ^= 1;
					vis[i - 1][j] ^= 1;
					vis[i - 2][j] ^= 1;
				}
				if (i <= n - 2 && vis[i][j] && vis[i + 1][j] && !vis[i + 2][j]) {
					vis[i][j] ^= 1;
					vis[i + 1][j] ^= 1;
					vis[i + 2][j] ^= 1;
					vector<pii> v;
					for (int x = 1; x <= n; ++x) {
						for (int y = 1; y <= m; ++y) {
							if (vis[x][y]) {
								v.pb(x, y);
							}
						}
					}
					if (S.find(v) == S.end()) {
						S.insert(v);
						q.push(v);
					}
					vis[i][j] ^= 1;
					vis[i + 1][j] ^= 1;
					vis[i + 2][j] ^= 1;
				}
				if (j >= 3 && vis[i][j] && vis[i][j - 1] && !vis[i][j - 2]) {
					vis[i][j] ^= 1;
					vis[i][j - 1] ^= 1;
					vis[i][j - 2] ^= 1;
					vector<pii> v;
					for (int x = 1; x <= n; ++x) {
						for (int y = 1; y <= m; ++y) {
							if (vis[x][y]) {
								v.pb(x, y);
							}
						}
					}
					if (S.find(v) == S.end()) {
						S.insert(v);
						q.push(v);
					}
					vis[i][j] ^= 1;
					vis[i][j - 1] ^= 1;
					vis[i][j - 2] ^= 1;
				}
				if (j <= m - 2 && vis[i][j] && vis[i][j + 1] && !vis[i][j + 2]) {
					vis[i][j] ^= 1;
					vis[i][j + 1] ^= 1;
					vis[i][j + 2] ^= 1;
					vector<pii> v;
					for (int x = 1; x <= n; ++x) {
						for (int y = 1; y <= m; ++y) {
							if (vis[x][y]) {
								v.pb(x, y);
							}
						}
					}
					if (S.find(v) == S.end()) {
						S.insert(v);
						q.push(v);
					}
					vis[i][j] ^= 1;
					vis[i][j + 1] ^= 1;
					vis[i][j + 2] ^= 1;
				}
			}
		}
	}
	printf("%d\n", ans);
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}