//editor: Jan Tang
//problem:
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstdlib>
using namespace std;
#define set0(a) memset(a,0,sizeof(a));
#define CIN(a,n) for(int i=1;i<=n;i++) cin>>a[i];
typedef long long ll;
typedef unsigned long long ull;
const int Mod = 1e9+7;
const int maxn = 100005;
const int inf = 0x3f3f3f3f;
int m,n,t,k;
int l[maxn], r[maxn], dl[maxn], dr[maxn];
/*==============================head==========================*/
int main(){
    scanf("%d", &t);
    while(t--){
        ll ans = 0;
        scanf("%d%d%d", &n, &m, &k);
        for(int i = 1; i <= n; i++) dl[i]=0;
        for(int i = 1; i <= m; i++) dr[i]=0;
        for(int i = 1; i <= k; i++){
            scanf("%d%d", &l[i], &r[i]);
            dl[l[i]]++;
            dr[r[i]]++;
        }
        for(int i = 1; i <= k; i++)
            ans += (ll)2*(dl[l[i]]-1)*(dr[r[i]]-1);
        cout<<ans<<endl;
    }
    return 0;
}