#include<cmath>

#include<stack>

#include<queue>

#include<cstdio>

#include<vector>

#include<cstring>

#include <iostream>

#include<algorithm>

using namespace std;

typedef long long ll;

const int maxn =  + ;

const int INF = 0x3f3f3f3f;

const int MOD = ;

int dp[][], ter[];

int vis[][];

int t, n, m, k;

int now[], pre[];

void getNow(int i){

    for(int k = ; k <= m; k++){

        if(vis[i][k]){

            now[k] = ;

        }

        else{

            if(pre[k] <= ) now[k] = ;

            else now[k] = ;

        }

    }

}

int getSt(){

    int ret = ;

    for(int k = ; k <= m; k++){

        ret = ret *  + now[k];

    }

    return ret;

}

void dfs(int i, int j, int num){

    int nowSt;

    if(j > m){

        nowSt = getSt();

        dp[i % ][nowSt] = max(dp[i % ][nowSt], num);

        return;

    }

    // ▇ ▇ ▇

    // ▇ ▇ ▇

    if(j >=  && !now[j - ] && !now[j - ] && !now[j]){

        now[j - ] = now[j - ] = now[j] = ;

        nowSt = getSt();

        dp[i % ][nowSt] = max(dp[i % ][nowSt], num + );

        dfs(i, j + , num + );

        now[j - ] = now[j - ] = now[j] = ;

    }

    // ▇ ▇

    // ▇ ▇

    // ▇ ▇

    if(j >=  && !now[j - ] && !now[j] && !pre[j - ] && !pre[j]){

        now[j - ] = now[j] = ;

        nowSt = getSt();

        dp[i % ][nowSt] = max(dp[i % ][nowSt], num + );

        dfs(i, j + , num + );

        now[j - ] = now[j] = ;

    }

    nowSt = getSt();

    dp[i % ][nowSt] = max(dp[i % ][nowSt], num);

    dfs(i, j + , num);

}

int main(){

    ter[] = ;

    for(int i = ; i <= ; i++){

        ter[i] = ter[i - ] * ;

    }

    scanf("%d", &t);

    while(t--){

        scanf("%d%d%d", &n, &m, &k);

        memset(vis, , sizeof(vis));

        for(int i = ; i <= k; i++){

            int x, y;

            scanf("%d%d", &x, &y);

            vis[x][y] = ;

        }

        //0 都可以，1 上一行不可以，2 都不可以

        int temp = ;

        for(int i = ; i <= m; i++) temp = temp *  + ;

        memset(dp[], -, sizeof(dp[]));

        dp[][temp] = ;

        for(int i = ; i <= n; i++){

            memset(dp[i % ], -, sizeof(dp[]));

            for(int st = ; st < ter[m]; st++){

                if(dp[(i + ) % ][st] == -) continue;

                int tmp = st;

                for(int j = m; j >= ; j--){

                    pre[j] = tmp % ;

                    tmp /= ;

                }

                getNow(i);

                dfs(i, , dp[(i + ) % ][st]);

            }

        }

        int Max = -;

        for(int i = ; i < ter[m]; i++)

            Max = max(Max, dp[n % ][i]);

        printf("%d\n", Max);

    }

    return ;

}