#include<bits/stdc++.h>
using namespace std;

int mp[10][10];
int n,m,k,ans;

void tiao(int res){
//	P now=find();
	ans=min(ans,res);
	for(int x=1;x<=n;x++){
		for(int y=1;y<=m;y++){
			if(!mp[x][y]) continue;
			mp[x][y]=0;
			if(x-2>=1&&mp[x-1][y]&&!mp[x-2][y]){
				mp[x-1][y]=0;mp[x-2][y]=1;
				tiao(res-1);
				mp[x-1][y]=1;mp[x-2][y]=0;
			}
			if(x+2<=n&&mp[x+1][y]&&!mp[x+2][y]){
				mp[x+1][y]=0;mp[x+2][y]=1;
				tiao(res-1);
				mp[x+1][y]=1;mp[x+2][y]=0;
				
			}
			if(y-2>=1&&mp[x][y-1]&&!mp[x][y-2]){
				mp[x][y-1]=0;mp[x][y-2]=1;
				tiao(res-1);
				mp[x][y-1]=1;mp[x][y-2]=0;
			
			}
			if(y+2<=m&&mp[x][y+1]&&!mp[x][y+2]){
				mp[x][y+1]=0;mp[x][y+2]=1;
				tiao(res-1);
				mp[x][y+1]=1;mp[x][y+2]=0;
			
			}
			mp[x][y]=1;
		}
	}

	
}

int main(){
	int t;cin>>t;
	while(t--){
		cin>>n>>m>>k;
		ans=1e9;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++) mp[i][j]=0;
		}
		for(int i=1;i<=k;i++){
			int x,y;cin>>x>>y;
			mp[x][y]=1;
		}
		tiao(k);
		cout<<ans<<endl;
	}
	
	return 0;
}