#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int maxn = 100005;

int x[maxn],y[maxn];
ll s1[maxn],s2[maxn];

int main(){
    int t,n,m,k,a,b;
    ll ans = 0;
    scanf("%d",&t);
    while(t--){
        ans = 0;
        scanf("%d%d%d",&n,&m,&k);
        memset(s1,0,sizeof(s1));
        memset(s2,0,sizeof(s2));
        for(int i = 0;i < k;i++){
            scanf("%d%d",&a,&b);
            s1[a]++;s2[b]++;
            x[i] = a;y[i] = b;
        }
        for(int i = 0;i < k;i++)
            ans += (s1[x[i]]-1)*(s2[y[i]]-1);
        printf("%I64d\n",ans*2);
    }
    return 0;
}