#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+5;
int T,n,m,k,val[N];
pair<int,int>v[N];
void add(int x,int v){for(;x<N;x+=x&-x)val[x]+=v;}
int query(int x){
int res=0;
for(;x;x-=x&-x)res+=val[x];
return res;
}
#undef int
int main(){
#define int long long
freopen("road.in","r",stdin);
freopen("road.out","w",stdout);
cin>>T;
for(int tt=1;tt<=T;tt++){
cin>>n>>m>>k;int t=max(n,m),ct=0;
memset(val,0,sizeof(val));
for(int i=1;i<=k;i++)cin>>v[i].first>>v[i].second;
sort(v+1,v+1+k);
for(int i=1;i<=k;i++){
int x=v[i].first,y=v[i].second;
ct+=query(m)-query(y),add(y,1);
}
cout<<"Test case "<<tt<<": "<<ct<<'\n';
}
return 0;
}