/*
找逆序对
*/
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
const int maxn=1000010;
long long b[maxn+100]; //1000+100
struct line
{
int x,y;
}a[maxn];
bool cmp(line a,line b)
{
return (a.x<b.x || (a.x==b.x && a.y<b.y));
}
int lowbit(int x)
{
return x&(-x);
}
void insert(int x)
{
for(int i=x;i>0;i-=lowbit(i))
b[i]++;
}
int query(int x)
{
long long ans=0;
for(int i=x;i<=maxn;i+=lowbit(i))
ans+=b[i];
return ans;
}
int main()
{
int t,n,m,k;
scanf("%d",&t);
for(int Case=1;Case<=t;Case++)
{
scanf("%d%d%d",&n,&m,&k);
for(int i=0;i<k;i++)
{
scanf("%d%d",&a[i].x,&a[i].y);
}
sort(a,a+k,cmp);
memset(b,0,sizeof(b));
long long sum=0;
for(int i=0;i<k;i++)
{
sum+=query(a[i].y+1); //找大的值
insert(a[i].y);
}
printf("Test case %d: %lld\n",Case,sum);
}
return 0;
}