#include <bits/stdc++.h>
#define Tairitsu return 0;
#define lowbit(x) (x & -x)
using namespace std;
int n, m, k, T, N;
int a, b;
int f[10005];
vector<pair<int, int> > v;
void add(int x, int y) {
	for (; x <= n; x += lowbit(x)) f[x] += y;
}
int ask(int x) {
	int ans = 0;
	for (; x; x -= lowbit(x)) ans += f[x];
	return ans;
}
bool cmp(pair<int, int> a, pair<int, int> b) {
	if (a.first != b.first) return a.first < b.first;
	return a.second < b.second;
}
int main() {
	freopen("road.in","r",stdin);
	freopen("road.out","w",stdout);
	scanf("%d", &T);
	N = T;
	while (T--) {
		v.clear();
		scanf("%d %d %d", &n, &m, &k);
		for (int i = 1; i <= k; i++) {
			scanf("%d %d", &a, &b);
			v.push_back(make_pair(a, b));
		}
		sort(v.begin(), v.end(), cmp);
		int cnt = 0;
		for (int i = v.size() - 1; i >= 0; i--) {
			cnt += ask(v[i].second - 1);
			add(v[i].second, 1);
		}
		printf("Test case %d: %d\n", N - T, cnt);
	}
	Tairitsu
}