#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

int T, n, m, q, visx[], visy[], ans, cantx[], canty[];

bool flag2 = false;

struct node

{

    int x, y;

}e[];

bool cmp(node a, node b)

{

    if (a.y == b.y)

        return a.x < b.x;

    return a.y < b.y;

}

int main()

{

    scanf("%d", &T);

    while (T--)

    {

        ans = ;

        memset(visx, , sizeof(visx));

        memset(visy, , sizeof(visy));

        memset(cantx, , sizeof(cantx));

        memset(canty, , sizeof(canty));

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

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

            scanf("%d%d", &e[i].x, &e[i].y);

        sort(e + , e +  + q, cmp);

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

        {

            if (!cantx[e[i].x] && !canty[e[i].y] && !visx[e[i].x] && !visy[e[i].y])

            {

                bool flag = false;

                for (int j = i + ; e[j].y == e[i].y; j++)

                {

                    if (!visx[e[j].x])

                    {

                        flag = true;

                        break;

                    }

                }

                if (flag)

                    visy[e[i].y] = ;

                else

                    visx[e[i].x] = ;

                cantx[e[i].x] = canty[e[i].y] = ;

                ans++;

            }

        }

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

    }

    return ;

}