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

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

struct P{
	int x,y;
};

P find(){
	for(int x=1;x<=n;x++){
		for(int y=1;y<=m;y++){
			if(mp[x][y]){
				if(x-2>=1&&mp[x-1][y]&&!mp[x-2][y]){
					return (P){x,y};
				}
				if(x+2<=n&&mp[x+1][y]&&!mp[x+2][y]){
					return (P){x,y};
				}
				if(y-2>=1&&mp[x][y-1]&&!mp[x][y-2]){
					return (P){x,y};
				}
				if(y+2<=m&&mp[x][y+1]&&!mp[x][y+2]){
					return (P){x,y};
				}			
			}
		}
	}
	return (P){0,0};
}

void tiao(int x,int y){
//	P now=find();
	if(x==0&&y==0) {
		int res=0;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				res+=mp[i][j];
			}
		}
		ans=min(ans,res);
		return;
	} 
//	cout<<x<<" "<<y<<endl;
	bool f=0;
	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(x-2,y);
		mp[x-1][y]=1;mp[x-2][y]=0;
		f=1;
	}
	if(x+2<=n&&mp[x+1][y]&&!mp[x+2][y]){
		mp[x+1][y]=0;mp[x+2][y]=1;
		tiao(x+2,y);
		mp[x+1][y]=1;mp[x+2][y]=0;
		f=1;
	}
	if(y-2>=1&&mp[x][y-1]&&!mp[x][y-2]){
		mp[x][y-1]=0;mp[x][y-2]=1;
		tiao(x,y-2);
		mp[x][y-1]=1;mp[x][y-2]=0;
		f=1;
	}
	if(y+2<=m&&mp[x][y+1]&&!mp[x][y+2]){
		mp[x][y+1]=0;mp[x][y+2]=1;
		tiao(x,y+2);
		mp[x][y+1]=1;mp[x][y+2]=0;
		f=1;
	}
	mp[x][y]=1;
	if(!f) {
		tiao(find().x,find().y);
	}
	
}

int main(){
	int t;cin>>t;
	while(t--){
		cin>>n>>m>>k;
		ans=1e9+10;
		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;
		}
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(mp[i][j]) tiao(i,j);	
			}
		}
		
		cout<<ans<<endl;
	}
	
	
	return 0;
}