#include <iostream>
#include <algorithm>
#include <vector>
#include <cstring>
using namespace std;
int n, m, go[][2]={{0,1},{0,-1},{1,0},{-1,0}}, ans;
bool vis[10][10];
struct note {
    int x, y;
};
vector<note> vec;
void dfs(int x, int y)
{
    for (int i=0; i<4; i++)
    {
        int x1 = x+go[i][0], y1=y+go[i][1];
        int x2 = x1+go[i][0], y2=y1+go[i][1];
        if (x1<1 || y1<1 || x1>n || y1>m) continue;
        if (x2<1 || y2<1 || x2>n || y2>m) continue;
        if(vis[x][y]&&vis[x1][y1]&&vis[x2][y2]==0)
        {
            
            vis[x][y]=0;
            vis[x1][y1]=0;
            vis[x2][y2]=1;
            for(int i=1; i<=n; i++)
                for(int j=1; j<=m; j++)
                    if(vis[i][j]==1) dfs(i, j);
            vis[x][y]=1;
            vis[x1][y1]=1;
            vis[x2][y2]=0;
        }
    }
    int cnt=0;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            if(vis[i][j]==1) cnt++;
    ans = min(ans, cnt);
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t, k, a, b;
    cin>>t;
    while(t--)
    {
        memset(vis, 0, sizeof(vis));
        cin>>n>>m>>k;
        ans=k;
        while(k--)
        {
            cin>>a>>b;
            vis[a][b]=1;
        }
        for(int i=1; i<=n; i++)
            for(int j=1; j<=m; j++)
                if(vis[i][j]==1) dfs(i, j);
        cout<<ans<<'\n';
    }
}
/*
for(int i=0;i<n;i++)
cout<<(long long)pow(2, 62);
3
3 4 5
2 2
1 2
1 4
3 4
1 1
1 3 3
1 1
1 2
1 3
2 1 1
2 1
*/