//poj 1038 状态DP
//思路源于解题报告:http://hi.baidu.com/lewutian/blog/item/0146f22706ba4108918f9da8.html,刘汝佳黑书也有本题题解
//PS: 此题做了一个通宵,只是因为一直不肯放弃自己原来的二进制的做法,做到四点多才改成三进制.现在的水平,变通对我来说太难
//了。。。
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int inf=1<<28;
int n,m,k;
const int vmax=59049;
int grid[151][10];
int dp[2][vmax+1];
int s1[11],s2[11];
int fac3[11];
int trans(int a[])
{
int ans=0;
for (int i=m-1;i>=0;i--) ans=ans*3+a[i];
return ans;
}
void trans(int num,int a[])
{
for (int i=0;i<m;i++)
{
a[i]=num%3;
num/=3;
}
}
void dfs(int pos,int s,int c)
{
if (s>=m)
{
int state=trans(s2);
dp[pos%2][state]=max(dp[pos%2][state],c);
return;
}
if (s<m-2 && s2[s]+s2[s+1]+s2[s+2]==0)
{
s2[s]=s2[s+1]=s2[s+2]=2;
dfs(pos,s+3,c+1);
s2[s]=s2[s+1]=s2[s+2]=0;
}
if (s<m-1 && s2[s]+s2[s+1]+s1[s]+s1[s+1]==0)
{
s2[s]=s2[s+1]=2;
dfs(pos,s+2,c+1);
s2[s]=s2[s+1]=0;
}
dfs(pos,s+1,c);
}
int main()
{
fac3[0]=1;
for (int i=1;i<=10;i++) fac3[i]=fac3[i-1]*3;
int t;
scanf("%d",&t);
while (t--)
{
int i,j;
scanf("%d%d%d",&n,&m,&k);
memset(grid,0,sizeof(grid));
while (k--)
{
scanf("%d%d",&i,&j);
grid[i-1][j-1]=1;
}
for (int i=0;i<m;i++) s1[i]=grid[0][i]+1;
memset(dp[0],-1,sizeof(dp[0]));
dp[0][trans(s1)]=0;
for (int i=1;i<n;i++)
{
memset(dp[i%2],-1,sizeof(dp[i%2]));
for (int state=0;state<fac3[m];state++)
{
if (dp[(i+1)%2][state]==-1) continue;
trans(state,s1);
for (int j=0;j<m;j++)
{
if (grid[i][j]) s2[j]=2;
else if (s1[j]) s2[j]=s1[j]-1;
else s2[j]=0;
}
//int temp=trans(s2);
//dp[i%2][temp]=dp[(i+1)%2][state];
dfs(i,0,dp[(i+1)%2][state]);
}
}
int ans=0;
for (int i=0;i<fac3[m];i++)
ans=max(max(dp[0][i],dp[1][i]),ans);
printf("%d/n",ans);
}
//system("pause");
return 0;
}