#include<bits/stdc++.h>
#define ll long long
#define int ll
#define PLL pair<int,int>
const int N=1e5+10;
using namespace std;
int ans;
void dfs( vector<vector<int>>a,int cnt,int i,int j,int n,int m)
{
    if(a[i][j]!=1)
        return;
    ans=min(ans,cnt);
   if(i-1>=1&&a[i-1][j]==1)
   {
       if(i-2>=1&&a[i-2][j]==0)
       {
           a[i][j]=0;
           a[i-1][j]=0;
           a[i-2][j]=1;
           dfs(a,cnt-1,i-2,j,n,m);
           a[i][j]=1;
           a[i-1][j]=1;
           a[i-2][j]=0;
       }
       if(i+1<=n&&a[i+1][j]==0)
       {
           a[i-1][j]=0;
           a[i][j]=0;
           a[i+1][j]=1;
           dfs(a,cnt-1,i+1,j,n,m);
           a[i-1][j]=1;
           a[i][j]=1;
           a[i+1][j]=0;
       }
   }
   if(i+1<=n&&a[i+1][j]==1)
   {
       if(i+2<=n&&a[i+2][j]==0)
       {
           a[i][j]=0;
           a[i+1][j]=0;
           a[i+2][j]=1;
           dfs(a,cnt-1,i+2,j,n,m);
           a[i][j]=1;
           a[i+1][j]=1;
           a[i+2][j]=0;
       }
       if(i-1>=1&&a[i-1][j]==0)
       {
           a[i+1][j]=0;
           a[i][j]=0;
           a[i-1][j]=1;
           dfs(a,cnt-1,i-1,j,n,m);
           a[i+1][j]=1;
           a[i][j]=1;
           a[i-1][j]=0;
       }
   }

    if(j+1<=m&&a[i][j+1]==1)
    {
        if(j+2<=m&&a[i][j+2]==0)
        {
            a[i][j]=0;
            a[i][j+1]=0;
            a[i][j+2]=1;
            dfs(a,cnt-1,i,j+2,n,m);
            a[i][j]=1;
            a[i][j+1]=1;
            a[i][j+2]=0;
        }
        if(j-1>=1&&a[i][j-1]==0)
        {
            a[i][j+1]=0;
            a[i][j]=0;
            a[i][j-1]=1;
            dfs(a,cnt-1,i,j-1,n,m);
            a[i][j+1]=1;
            a[i][j]=1;
            a[i][j-1]=0;
        }
    }
    if(j-1>=1&&a[i][j-1]==1)
    {
        if(j-2>=1&&a[i][j-2]==0)
        {
            a[i][j]=0;
            a[i][j-1]=0;
            a[i][j-2]=1;
            dfs(a,cnt-1,i,j-2,n,m);
            a[i][j]=1;
            a[i][j-1]=1;
            a[i][j-2]=0;
        }
        if(j+1<=m&&a[i][j+1]==0)
        {
            a[i][j-1]=0;
            a[i][j]=0;
            a[i][j+1]=1;
            dfs(a,cnt-1,i,j+1,n,m);
            a[i][j-1]=1;
            a[i][j]=1;
            a[i][j+1]=0;
        }
    }
}
void solve()
{
    int n,m,k;
    cin>>n>>m>>k;
    vector<vector<int>>a(7,vector<int>(7,0));
    int cnt=0;
    for(int i=1;i<=k;i++)
    {
        int x,y;
        cin>>x>>y;
        a[x][y]=1;
        cnt++;
    }
    ans=cnt;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            //cout<<i<<j<<"\n";
            dfs(a,cnt,i,j,n,m);
        }
    }
    cout<<ans<<"\n";


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