#include "bits/stdc++.h"
#define int long long
using namespace std;
const int N = 2e6 + 10;
int n, m, k;
int a[10][10],num,ans;
struct node
{
    int x, y; /* data */
} q[N];
bool cmp(node w, node v)
{
    return w.x < v.x;
}
inline int dfs()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(a[i][j]&&i+1<=n&&a[i+1][j]) 
            {
               if(i+2<=n&&!a[i+2][j])
               {
                   a[i][j] = a[i + 1][j] = 0;
                   a[i+2][j] = 1;
                   num--;
                   ans=min(ans,num);
                   dfs();
                   a[i][j] = a[i + 1][j] = 1;
                   a[i + 2][j] = 0;
                   num++;
               }
               if (i-1>=1 && !a[i -1][j])
               {
                   a[i][j] = a[i + 1][j] = 0;
                   a[i -1][j] = 1;
                   num--;
                   ans = min(ans, num);
                   dfs();
                   a[i][j] = a[i + 1][j] = 1;
                   a[i -1][j] = 0;
                   num++;
               }
            }
            if(a[i][j]&&j+1<=m&&a[i][j+1])
            {
                if(j+2<=m&&!a[i][j+2])
                {
                    a[i][j]=a[i][j+1]=0;
                    a[i][j+2]=1;
                    num--;
                    ans = min(ans, num);
                    dfs();
                    a[i][j] = a[i][j + 1] = 1;
                    a[i][j + 2] = 0;
                    num++;
                }
                if(j-1>=1&&!a[i][j-1])
                {
                    a[i][j] = a[i][j + 1] = 0;
                    a[i][j -1] = 1;
                    num--;
                    ans = min(ans, num);
                    dfs();
                    a[i][j] = a[i][j + 1] = 1;
                    a[i][j -1] = 0;
                    num++;
                }
            }
        }
    }
}
void solve()
{
    //cin >> n;
    for(int i=0;i<10;i++)
       for(int j=0;j<10;j++) a[i][j]=0;
    cin >> n >> m >> k;
    ans=k;
    num=k;
    for (int i = 1; i <= k; i++)
    {
        int x, y;
        cin >> x >> y;
        a[x][y] = 1;
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            if (a[i][j])
                dfs();
        }
    }
    cout<<ans<<endl;
    // for (int i = 1; i <= n; i++)
    // {
    //     cin >> a[i];
    // }
    // cin >> m;
    // int h = 1, t = 0;
    // for (int i = 1; i <= m; i++)
    // {
    //     cin >> q[i].x >> q[i].y;
    // }
    // sort(q + 1, q + m + 1, cmp);
    // for (int i = 1; i <= m; i++)
    // {
    //     int l = q[i].x, r = q[i].y;
    // }
}
signed main()
{

    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);

    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}