1038

/*
状态压缩类DP
*/

// include file
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <ctime>

#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <bitset>

#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
#include <functional>

using namespace std;

// typedef
typedef long long LL;
typedef unsigned long long ULL;

// 
#define read freopen("in.txt","r",stdin)
#define write freopen("out.txt","w",stdout)
#define FORi(a,b,c) for(int i=(a);i<(b);i+=c)
#define FORj(a,b,c) for(int j=(a);j<(b);j+=c)
#define FORk(a,b,c) for(int k=(a);k<(b);k+=c)
#define FORp(a,b,c) for(int p=(a);p<(b);p+=c)
#define FORii(a,b,c) for(int ii=(a);ii<(b);ii+=c)
#define FORjj(a,b,c) for(int jj=(a);jj<(b);jj+=c)
#define FORkk(a,b,c) for(int kk=(a);kk<(b);kk+=c)

#define FF(i,a)    for(int i=0;i<(a);i++)
#define FFD(i,a)   for(int i=(a)-1;i>=0;i--)

#define Z(a) (a<<1)
#define Y(a) (a>>1)

const double eps = 1e-6;
const double INFf = 1e10;
const int INFi = 1000000000;
const double Pi = acos(-1.0);

template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T TMAX(T x,T y)
{
	if(x>y) return x;
	return y;
}
template<class T> inline T TMIN(T x,T y)
{
	if(x<y) return x;
	return y;
}
template<class T> inline void SWAP(T &x,T &y)
{
	T t = x;
	x = y;
	y = t;
}
template<class T> inline T MMAX(T x,T y,T z)
{
	return TMAX(TMAX(x,y),z);
}


// code begin
int T,N,M,K;

int mp[152][12];
int currow[12]; //当前行的状态
int prerow[12]; //之前行的状态
int curten;
int preten;
int premax;
int premin;
int curmax;
int curmin;
int san[12];    //打表 
int dp[2][59050]; //滚动数组，否则内存太大
int ret;

void Init()
{
	san[0] = 1;
	FORi(1,11,1)
		san[i] = san[i-1]*3;
}
void san2ten(int A[],int &ans)
{
	ans  = 0;
	FORi(1,M+1,1)
	{
		ans = ans*3+A[i];
	}
}
void ten2san(int ten,int A[])
{
	for(int i=M;i>=1;i--)
	{
		A[i] = ten%3;
		ten/=3;
	}
}

void dfs(int r,int c,int v,int cs)
{
	if(c>=M)
	{
		dp[r&1][cs] = TMAX(dp[r&1][cs],dp[(r+1)&1][preten]+v);
		if(dp[r&1][cs]>ret)
			ret = dp[r&1][cs];
		if(cs>curmax)
			curmax = cs;
		if(cs<curmin)
			curmin = cs;
		return;
	}

	if(c+2<=M)
	{
		if(currow[c] + currow[c+1] + currow[c+2]==0)
		{
			currow[c] = currow[c+1]=currow[c+2] = 2;
			cs += currow[c]*san[M-c]+currow[c+1]*san[M-1-c]+currow[c+2]*san[M-2-c];
			dfs(r,c+3,v+1,cs);
			cs -= currow[c]*san[M-c]+currow[c+1]*san[M-1-c]+currow[c+2]*san[M-2-c];
			currow[c] = currow[c+1]=currow[c+2] = 0;
		}
	}
	if(c+1<=M)
	{
		if(currow[c]+currow[c+1]==0 && prerow[c]+prerow[c+1]==0)
		{
			currow[c] = currow[c+1] = 2;
			cs += currow[c]*san[M-c] + currow[c+1]*san[M-1-c];
			dfs(r,c+2,v+1,cs);
			cs -= currow[c]*san[M-c] + currow[c+1]*san[M-1-c];
			currow[c] = currow[c+1] = 0;
		}
	}
	dfs(r,c+1,v,cs);
}

int main()
{
	// 1-index的
	read;
	write;
	Init();
	int r,c;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d %d %d",&N,&M,&K);
		memset(mp,0,sizeof(mp));
		FORi(0,K,1)
		{
			scanf("%d %d",&r,&c);
			mp[r][c] = 1;
		}

		// 0表示当前和之前都是0
		// 1表示当前是0.之前是1 
		// 2表示当前是1
		FORi(1,M+1,1)
		{
			currow[i] = mp[1][i]+1;
		}

		ret = 0;
		memset(dp,-1,sizeof(dp));
		san2ten(currow,curten);
		dp[1][curten] = 0;
		premax = curten+1;
		premin = curten;
		FORi(2,N+1,1)
		{
			memset(dp[i&1],-1,sizeof(dp[i&1]));
			curmax = 0;
			curmin = san[10]+1;
			FORj(premin,premax,1) //枚举之前的状态
			{
				if(dp[(i+1)&1][j]==-1)
					continue;

				// 如果之前该状态存在
				ten2san(j,prerow);

				// 根据之前状态推测现在的状态
				FORk(1,M+1,1)
				{
					currow[k] = (prerow[k]<=1?0:1);
					if(mp[i][k]==1)
						currow[k] = 2;
				}
				preten = j;
				san2ten(currow,curten);
				//
				dfs(i,1,0,curten); //i行，从1列，0个，之前的状态10进制
			}
			premax = curmax+1;
			premin = curmin;
		}

		printf("%d\n",ret);
	}
	return 0;
}