#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=200010;
long long ans;
int T,n,m,k,u[maxn],v[maxn],dl[maxn],dr[maxn];
int main(){
    scanf("%d",&T);
    while(T--){
        memset(dl,0,sizeof(dl));
        memset(dr,0,sizeof(dr));
        scanf("%d%d%d",&n,&m,&k);
        for(int i=1;i<=k;i++){
            scanf("%d%d",&u[i],&v[i]);
            dl[u[i]]++;dr[v[i]]++;
        }
        ans=0;
        for(int i=1;i<=k;i++)ans+=(long long)(dl[u[i]]-1)*(long long)(dr[v[i]]-1);
        printf("%I64d\n",ans<<1);
    }
    return 0;
}