//OJ 1391
 //by Cydiater
 //2016.8.22
 #include <iostream>
 #include <cstring>
 #include <string>
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <ctime>
 #include <iomanip>
 #include <queue>
 #include <map>
 #include <algorithm>
 using namespace std;
 #define ll long long
 #define up(i,j,n)       for(ll i=j;i<=n;i++)
 #define down(i,j,n)     for(ll i=j;i>=n;i--)
 <<;
 const int oo=0x3f3f3f3f;
 inline ll read(){
       ,f=;
       ;ch=getchar();}
       +ch-';ch=getchar();}
       return x*f;
 }
 ll N,M,K,f[][MAXN],ans=,T;
 ][];
 namespace solution{
       void print(ll s){
             ll a[];
             memset(a,,sizeof(a));
             down(i,M,){
                   a[i]=s%;
                   s/=;
             }
             up(i,,M)cout<<a[i];;
             puts("");
       }
       inline ll get(ll s,ll pos){
             pos=M-pos-;
             ll tmp=s&(<<(pos<<));
             tmp>>=(pos<<);
             return tmp;
       }
       inline ll updata(ll s,ll st,ll nd,ll num){
             ll ss=st,n=nd;
             st=M-n-;nd=M-ss-;
             up(i,st,nd)s|=(num<<(i<<));
             return s;
       }
       void init(){
             memset(f,,sizeof(f));
             memset(flag,,sizeof(flag));
             N=read();M=read();K=read();
             ans=;
             up(i,,K){
                   ll x=read(),y=read()-;
                   flag[x][y]=;
             }
       }
       bool check(ll x,ll st,ll nd,ll s){
             ||st>=M||nd<||nd>=M||x<=||x>N)   ;
             up(i,st,nd);/*special case*/
             up(i,st,nd))                ;
             ;
       }
       void dfs(ll x,ll y,ll s,ll now,ll k){
             ){
                   f[x%][now]=max(f[x%][now],f[(x%)^][s]+k);
                   ans=max(ans,f[x%][now]);
                   /*puts("s:");print(s);puts("now:");print(now);
                   printf("x:%d f[x%%2][now]:%d ",x,f[x%2][now]);
                   cout<<"k:"<<k<<" ans:"<<ans<<endl<<endl;*/
                   return;
             }
             //cout<<now<<endl;
             ){
                   now|=(<<((M-y-)<<));
                   dfs(x,y-,s,now,k);
                   return;
             }
             ,y-,y+,s),y+,now),s,updata(now,y-,y+,),k+);
             ,y,y+,s),now)][y]&&!flag[x+][y+]&&x+<=N,s,updata(now,y,y+,),k+);
             dfs(x,y-,s,now,k);
       }
       void dp(){
             f[][]=;
             up(i,,N){
                   up(s,,(<<(M<<))-)f[(i%)^][s]=;
                   up(s,,(<<(M<<))-)][s]>)dfs(i+,M-,s,,);
             }
       }
       void output(){
             cout<<ans-<<endl;
       }
 }
 int main(){
       //freopen("input.in","r",stdin);
       //freopen("output.out","w",stdout);
       using namespace solution;
       T=read();
       while(T--){
             init();
             dp();
             output();
       }
       ;
 }