#include<bits/stdc++.h>
using namespace std;
int T;
int n,m,k;
int mp[10][10];
vector<pair<int,int> >v;
int ans=6;
void dfs(vector<pair<int,int> >cur)
{
    ans=min(ans,(int)cur.size());
    vector<pair<int,int> >nxt;
    for(int i=0;i<cur.size();i++)
    for(int j=0;j<cur.size();j++)
    if(i!=j&&abs(cur[i].first-cur[j].first)+abs(cur[i].second-cur[j].second)==1)
    {
        int nx=cur[j].first*2-cur[i].first;
        int ny=cur[j].second*2-cur[i].second;
        if(nx<1||nx>n||ny<1||ny>m)continue;
        if(mp[nx][ny])continue;
        mp[nx][ny]=1;
        mp[cur[i].first][cur[i].second]=0;
        mp[cur[j].first][cur[j].second]=0;
        nxt.clear();
        for(int k=0;k<cur.size();k++)if(k!=j&&k!=i)nxt.push_back(cur[k]);
        nxt.push_back({nx,ny});
        dfs(nxt);
        mp[nx][ny]=0;
        mp[cur[i].first][cur[i].second]=1;
        mp[cur[j].first][cur[j].second]=1;
    }
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(0);
    cin>>T;
    while(T--)
    {
        memset(mp,0,sizeof(mp));
        v.clear();
        cin>>n>>m>>k;
        for(int i=1;i<=k;i++)
        {
            int x,y;
            cin>>x>>y;
            mp[x][y]=1;
            v.push_back({x,y});
        }
        ans=v.size();
        dfs(v);
        cout<<ans<<'\n';
    }
}