1 #include <bits/stdc++.h>
 2 using namespace std;
 3 
 4 const int maxn = 210;
 5 int nu, nv;
 6 int G[maxn][maxn];
 7 int linker[maxn];
 8 bool vis[maxn];
 9 
10 bool dfs(int u) {
11     for(int v = 1; v <= nv; v++) {
12         if(G[u][v] && !vis[v]) {
13             vis[v] = 1;
14             if(linker[v] == -1 || dfs(linker[v])) {
15                 linker[v] = u;
16                 return 1;
17             }
18         }
19     }
20     return 0;
21 }
22 
23 int hungary() {
24     int ret = 0;
25     memset(linker, -1, sizeof(linker));
26     for(int u = 1; u <= nu; u++) {
27         memset(vis, 0, sizeof(vis));
28         if(dfs(u)) ret++;
29     }
30     return ret;
31 }
32 
33 int k;
34 
35 int main() {
36     // freopen("in", "r", stdin);
37     int u, v;
38     int _ = 1;
39     while(~scanf("%d%d%d",&nu,&nv,&k)&&nu+nv) {
40         for(int i = 1; i <= nu; i++) {
41             for(int j = 1; j <= nv; j++) {
42                 G[i][j] = G[j][i] = 1;
43             }
44         }
45         for(int i = 0; i < k; i++) {
46             scanf("%d%d",&u,&v);
47             G[u][v] = 0;
48         }
49         printf("Case %d: %d\n", _++, nu+nv-hungary());
50     }
51     return 0;
52 }