#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#define X first
#define Y second
#define clr(u,v); memset(u,v,sizeof(u));
#define in() freopen("data","r",stdin);
#define out() freopen("ans","w",stdout);
#define Clear(Q); while (!Q.empty()) Q.pop();
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<string, int> psi;

const int maxn = 2e5 + 10;
const int INF = 0x3f3f3f3f;
pii P[maxn];
ll cnt[maxn];
int main()
{
#ifdef LOCAL
    in();
#endif
    int T;
    scanf("%d",&T);
    while (T--)
    {
        int n,m,k;
        scanf("%d%d%d",&n,&m,&k);
        clr(cnt,0);
        for (int i=0;i<k;i++)
        {
            scanf("%d%d",&P[i].X,&P[i].Y);
            P[i].Y+=n;
            cnt[P[i].X]++;
            cnt[P[i].Y]++;
        }
        ll ans=0;
        for (int i=0;i<k;i++)
        ans+=max(0LL,(cnt[P[i].X]-1)*(cnt[P[i].Y]-1));
        printf("%I64d\n",2*ans);
    }
    return 0;
}