#include <cstdio>

#include <cstring>

using namespace std;

const int MAXV=500;

int n,G[MAXV][MAXV],use[MAXV],match[MAXV];

int g,b,m,x,y,cas=0;

bool dfs(int x){

    for(int i=1;i<=b;i++){

        if(use[i]==0&&G[x][i]){

            use[i]=1;

            int j=match[i];

            if(j==-1||dfs(j)){

                match[i]=x;

                return 1;

            }

        }

    }return 0;

}

int bipartite_matching(){

    int count=0;

    memset(match,-1,sizeof(match));

    for(int i=1;i<=g;i++){

        for(int j=1;j<=b;j++)use[j]=0;

        if(dfs(i))count++;

    }return count;

}

void init(){

    memset(G,1,sizeof(G));

    for(int i=0;i<m;i++){

        scanf("%d%d",&x,&y);

        G[x][y]=0;

    }

}

void solve(){

    printf("%d\n",g+b-bipartite_matching());

}

int main(){

    while(scanf("%d%d%d",&g,&b,&m),g||b||m){

        printf("Case %d: ",++cas);

        init();

        solve();

    }return 0;

}