#include <stdio.h>
#include <algorithm>

using namespace std;

//long long
const long long maxn = 120000;
long long n , m , k;
long long in1[maxn] , in2[maxn];
long long u[maxn] , v[maxn];
long long ans;
void clear () {
    long long i;
    for ( i = 1 ; i <= n ; i++ ) in1[i] = 0;
    for ( i = 1 ; i <= m ; i++ ) in2[i] = 0;
}
void work () {
    long long i;
    scanf ( "%I64d%I64d%I64d" , &n , &m , &k );
    clear ();
    for ( i = 1 ; i <= k ; i++ ) {
        scanf ( "%I64d%I64d" , &u[i] , &v[i] );
        in1[u[i]]++; in2[v[i]]++;
    }
    ans = 0;
    for ( i = 1 ; i <= k ; i++ ) {
        ans += (in1[u[i]]-1) * (in2[v[i]]-1) * 2;
    }
    printf ( "%I64d\n" , ans );
}
int main () {
    int t;
    scanf ( "%d" , &t );
    while ( t-- ) work ();
    return 0;
}