#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define rep(i, l, r) for (int i = l; i < r; ++i)
#define per(i, r, l) for (int i = r-1; i >= l; --i)
typedef long long ll;
typedef pair<int, int> PI;
template<typename T> bool setmax(T &a, T b) { return (a < b ? a = b, 1 : 0); }
template<typename T> bool setmin(T &a, T b) { return (a > b ? a = b, 1 : 0); }

int dir[4][2]={
    {1,0},{-1,0},{0,1},{0,-1}
};


void dfs(vector<vector<bool>>& broad,int& ans){
    bool f=1;
    int n=broad.size();
    int m=broad[0].size();
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            if(broad[i][j]==0)continue;
            for(int d=0;d<4;d++){
                int x1=i+dir[d][0];
                int x2=i+2*dir[d][0];
                int y1=j+dir[d][1];
                int y2=j+2*dir[d][1];
                if(x1>=0&&x1<n&&x2>=0&&x2<n&&y1>=0&y1<m&&y2>=0&&y2<m&&broad[x1][y1]==1&&broad[x2][y2]==0){
                    f=0;
                    broad[i][j]=0;
                    broad[x1][y1]=0;
                    broad[x2][y2]=1;
                    dfs(broad,ans);
                    broad[i][j]=1;
                    broad[x1][y1]=1;
                    broad[x2][y2]=0;
                }
            }
        }
    }
    if(f==1){
        int cnt=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                if(broad[i][j])cnt++;
            }
        }
        ans=min(ans,cnt);
    }
}

void solve() {
    int n,m,k;
    cin>>n>>m>>k;
    vector<vector<bool>> broad;
    broad.resize(n,vector<bool>(m,0));
    for(int i=0;i<k;i++){
        int x,y;
        cin>>x>>y;
        broad[x-1][y-1]=1;
    }
    int ans=36;
    dfs(broad,ans);
    cout<<ans<<'\n';
}
int main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    int tt; cin >> tt;
    while (tt--) solve();

    return 0;
}