#include<bits/stdc++.h>
using namespace std;
const int INF=0x3f3f3f3f;
#define endl '\n'
#define x first
#define y second
typedef long long ll;
typedef pair<int,int> PII;
bool book[20][20];
int ans;
void dfs(int n,int m,int k)
{
	ans=min(k,ans);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
		{
			if(book[i][j] && book[i+1][j] && !book[i+2][j] && i+2<=n)
			{
				book[i][j]=0;
				book[i+1][j]=0;
				book[i+2][j]=1;
				dfs(n,m,k-1);
				book[i][j]=1;
				book[i+1][j]=1;
				book[i+2][j]=0;
			}
			if(book[i][j] && book[i-1][j] && !book[i-2][j] && i-2>=1)
			{
				book[i][j]=0;
				book[i-1][j]=0;
				book[i-2][j]=1;
				dfs(n,m,k-1);
				book[i][j]=1;
				book[i-1][j]=1;
				book[i-2][j]=0;
			}
			if(book[i][j] && book[i][j+1] && !book[i][j+2] && j+2<=n)
			{
				book[i][j]=0;
				book[i][j+1]=0;
				book[i][j+2]=1;
				dfs(n,m,k-1);
				book[i][j]=1;
				book[i][j+1]=1;
				book[i][j+2]=0;
			}
			if(book[i][j] && book[i][j-1] && !book[i][j-2] && j-2>=1)
			{
				book[i][j]=0;
				book[i][j-1]=0;
				book[i][j-2]=1;
				dfs(n,m,k-1);
				book[i][j]=1;
				book[i][j-1]=1;
				book[i][j-2]=0;
			}
		}
}
void solve()
{
	memset(book,0,sizeof(book));
	int n,m,k;
	cin>>n>>m>>k;
	for(int i=1;i<=k;i++)
	{
		int x,y;
		cin>>x>>y;
		book[x][y]=1;
	}
	ans=k;
	dfs(n,m,k);
	cout<<ans<<endl;
}
int main()
{
	ios::sync_with_stdio(false);
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		solve();
	}
	return 0;
}