#include <queue>#include <stack>#include <math.h>#include <stdio.h>#include <stdlib.h>#include <iostream>#include <limits.h>#include <string.h>#include <algorithm>#define MAX 1010using namespace std;typedef struct ARR{int x,y;}ARR;ARR a[MAX*MAX];long long c[MAX];bool cmp( ARR a ,ARR b ){if( a.y == b.y )return a.x > b.x;return a.y > b.y;}int Lowbit(int x){return x & (-x);}void Updata(int x){while( x < MAX ){c[x]++;x += Lowbit(x);}}long long Getsum(int x){long long sum = 0ll;while( x > 0 ){sum += c[x];x -= Lowbit(x);}return sum;}int main(){int ncases,ind = 1;int n,m,k,i;long long sum;scanf("%d",&ncases);while( ncases-- ){memset(c,0,sizeof(c));sum = 0ll;scanf("%d%d%d",&n,&m,&k);for(i=1; i<=k; i++)scanf("%d%d",&a[i].x,&a[i].y);sort(a+1,a+1+k,cmp);long long ans;for(i=1; i<=k; i++){ans = Getsum(a[i].x-1);sum += ans;Updata(a[i].x);}printf("Test case %d: %lldn",ind++,sum);}return 0;}
