#include <iostream>
#include <algorithm>
#include <map>
#include <vector>
#include <cstring>
using namespace std;
const int N=1000005;
int t,n,m,k;
vector<pair<int,int>>v;
int a[N],tr[N];
int lb(int x){
    return x&(-x);
}
void add(int x,int y){
    for(int i=x;i<=k;i+=lb(i)){
        tr[i]+=y;
    }
}
int q(int x){
    int ans=0;
    for(int i=x;i>0;i-=lb(i)){
        ans+=tr[i];
    }
    return ans;
}
int main(){
    freopen("road.in","r",stdin);
    freopen("road.out","w",stdout);
    cin>>t;
    for(int _=1;_<=t;_++){
    	memset(tr,0,sizeof(tr));
    	v.clear();
        cin>>n>>m>>k;
        for(int i=1;i<=k;i++){
            int x,y;
            cin>>x>>y;
            v.push_back(make_pair(x,y));
        }
        
        sort(v.begin(),v.end());
        for(int i=0;i<k;i++){
            a[i+1]=v[i].second;
//            add(a[i+1],1);
        }
        int ans=0;
        for(int i=k;i>=1;i--){
            ans+=q(a[i]-1);
            add(a[i],1);
        }
        cout<<"Test case "<<_<<": "<<ans<<endl;
    }
    return 0;
}