#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <ctime>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define calm (l+r)>>1
const int INF = 2139062143;

const int maxn=100000+10;
pii f[maxn];
int dx[maxn],dy[maxn];
int main(){
    //freopen("D://input.txt","r",stdin);
    int T;scanf("%d",&T);
    while(T--){
        int n,m,k;scanf("%d%d%d",&n,&m,&k);
        memset(dx,0,sizeof dx);
        memset(dy,0,sizeof dy);
        for(int i=1;i<=k;i++){
            scanf("%d%d",&f[i].first,&f[i].second);
            dx[f[i].first]++;dy[f[i].second]++;
        }
        if(n<2||m<2){
            printf("0\n");
            continue;
        }
        ll ans=0;
        for(int i=1;i<=k;i++){
            ans+=(ll)(dx[f[i].first]-1)*(dy[f[i].second]-1)*2ll;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}