#include<stdio.h>

 #include<string.h>

 const int maxn=1e5+;

 const int maxm=1e5+;

 int head[maxn],point[maxm],nxt[maxm],size;

 int match[maxn],vis[maxn];

 int get[maxn];

 void init(){

     memset(head,-,sizeof(head));

     size=;

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

     memset(get,-,sizeof(get));

 }

 void add(int a,int b){

     point[size]=b;

     nxt[size]=head[a];

     head[a]=size++;

 }

 int del;

 int dfs(int s,bool F){

     for(int i=head[s];~i;i=nxt[i]){

         if(!F&&i==del)continue;

         int j=point[i];

         if(!vis[j]){

             vis[j]=;

             if(match[j]==-||dfs(match[j],F)){

                 if(F){

                     match[j]=s;

                     get[s]=i;

                 }

                 return ;

             }

         }

     }

     return ;

 }

 int main(){

     int T=;

     int n,m,k;

     while(scanf("%d%d%d",&n,&m,&k)!=EOF){

         ++T;

         init();

         while(k--){

             int a,b;

             scanf("%d%d",&a,&b);

             add(a,n+b);

         }

         int ans1=;

         for(int i=;i<=n;++i){

             memset(vis,,sizeof(vis));

             if(dfs(i,))ans1++;

         }

         int ans=;

         for(int i=;i<=n;++i){

             if(get[i]!=-){

                 del=get[i];

                 match[point[del]]=-;

                 get[i]=-;

                 memset(vis,,sizeof(vis));

                 if(!dfs(i,))ans++;

                 get[i]=del;

                 match[point[del]]=i;

             }

         }

         printf("Board %d have %d important blanks for %d chessmen.\n",T,ans,ans1);

     }

     return ;

 }