#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 2e5+7,mod=1e9+7,INF=1e18;
#define endl '\n'

void solve(){
	ll n, m, k;
	cin >> n >> m >> k;
	map<pair<ll, ll>, ll> mp;
	for(ll i = 1 ; i <= k; i++){
		ll x, y; cin >> x >> y;
		mp[{x, y}] = 1;
	}
	
	ll ans = 1e9;
	auto dfs = [&](auto &&dfs) -> void{
		vector<pair<pair<ll, ll>, ll>> ve;	
		for(auto [u, v] : mp){
			auto [x, y] = u;
			if(mp.find({x, y + 1}) != mp.end() && y + 2 <= m && mp.find({x, y + 2}) == mp.end()){
				ve.push_back({{x, y}, 1});
			}
			if(mp.find({x + 1, y}) != mp.end() && x + 2 <= n && mp.find({x + 2, y}) == mp.end()){
				ve.push_back({{x, y}, 2});
			}
			if(mp.find({x, y - 1}) != mp.end() && y - 2 >= 1 && mp.find({x, y - 2}) == mp.end()){
				ve.push_back({{x, y}, 3});
			}
			if(mp.find({x - 1, y}) != mp.end() && x - 2 >= 1 && mp.find({x - 2, y}) == mp.end()){
				ve.push_back({{x, y}, 4});
			}
		} 
		
		if(ve.size() == 0){
			ll num = mp.size();
			ans = min(num, ans);
			return;
		}
		
		for(auto [u, v] : ve){
			auto [x, y] = u;
			if(v == 1){
				mp.erase(u);
				mp.erase({x, y + 1});
				mp[{x, y + 2}] = 1;
				dfs(dfs);
				mp[u] = 1;
				mp[{x, y + 1}] = 1;
				mp.erase({x, y + 2});	
			}else if(v == 2){
				mp.erase(u);
				mp.erase({x + 1, y});
				mp[{x + 2, y}] = 1;
				dfs(dfs);
				mp[u] = 1;
				mp[{x + 1, y}] = 1;
				mp.erase({x + 2, y});
			}else if(v == 3){
				mp.erase(u);
				mp.erase({x, y - 1});
				mp[{x, y - 2}] = 1;
				dfs(dfs);
				mp[u] = 1;
				mp[{x, y - 1}] = 1;
				mp.erase({x, y - 2});
			}else if(v == 4){
				mp.erase(u);
				mp.erase({x - 1, y});
				mp[{x - 2, y}] = 1;
				dfs(dfs);
				mp[u] = 1;
				mp[{x - 1, y}] = 1;
				mp.erase({x - 2, y});
			}
		}
	};
	dfs(dfs);
	
	cout << ans << endl;
	
}
int main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	ll T=1;
	
	cin>>T;
	
	while(T--){
		solve();
	}
	return 0;
}