#include<bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
#define lowbit(i) ((i)&(-i))
#define pii pair<int,int>
#define endl '\n'
#define mk(x,y) make_pair(x,y)
#define popcount(x) __builtin_popcount(x)
#define LF(x) fixed<<setprecision(x)
const double pi=3.14159265358979323846;
const double eps=1e-9;
const int inf=1e9;
const long long INF=4e18;
const int mod=1e9+7;
using namespace std;
const int N=1e5+10;

void solve()
{
    int n,m,k;
    cin>>n>>m>>k;
    vector<vector<int>>a(n+1,vector<int>(m+1));
    for(int i=1;i<=k;i++){
    	int x,y;
    	cin>>x>>y;
    	a[x][y]=1;
    }
    int ans=k;
    function<void(int)> dfs=[&](int cnt){
    	ans=min(ans,cnt);
    	for(int i=1;i<=n;i++){
    		for(int j=1;j<=m;j++){
    			if(i>=3&&a[i][j]==1&&a[i-1][j]==1&&a[i-2][j]==0){//up
    				a[i][j]=a[i-1][j]=0;
    				a[i-2][j]=1;
    				dfs(cnt-1);
    				a[i][j]=a[i-1][j]=1;
    				a[i-2][j]=0;
    			}
    			else if(i<=n-2&&a[i][j]==1&&a[i+1][j]==1&&a[i+2][j]==0){//down
    				a[i][j]=a[i+1][j]=0;
    				a[i+2][j]=1;
    				dfs(cnt-1);
    				a[i][j]=a[i+1][j]=0;
    				a[i+2][j]=1;
    			}
    			if(j>=3&&a[i][j]==1&&a[i][j-1]==1&&a[i][j-2]==0){//left
    				a[i][j]=a[i][j-1]=0;
    				a[i][j-2]=1;
    				dfs(cnt-1);
    				a[i][j]=a[i][j-1]=1;
    				a[i][j-2]=0;
    			}
    			else if(j<=m-2&&a[i][j]==1&&a[i][j+1]==1&&a[i][j+2]==0){//right
    				a[i][j]=a[i][j+1]=0;
    				a[i][j+2]=1;
    				dfs(cnt-1);
    				a[i][j]=a[i][j+1]=1;
    				a[i][j+2]=0;
    			}
    		}
    	}
    };
    dfs(k);
    cout<<ans<<endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int T=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}