#include<bits/stdc++.h>
using namespace std;
const int N=1e3+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;
}
int main(){
	freopen("road.in","r",stdin);
	freopen("road.out","w",stdout);
	for(cin>>T;T;T--){
		cin>>n>>m>>k;int t=max(n,m),ct=0;
		for(int i=1;i<=t;i++)val[i]=0;
		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-1),add(y,1);
		} 
		cout<<"Test case id: "<<ct<<'\n';
	}
	return 0;
}