#include <cstdio>

 #include <iostream>

 #include <algorithm>

 #include <string>

 #include <cstring>

 #include <vector>

 using namespace std;

 const int M=;

 int match[M];

 bool vis[M];

 vector<int>map[M];

 string lk[M],dislk[M];

 int n,m,p,uN;

 bool dfs(int u){

     for(int i=;i<map[u].size();i++){

         if(!vis[map[u][i]]){

             vis[map[u][i]]=true;

             if(match[map[u][i]]==-||dfs(match[map[u][i]])){

                 match[map[u][i]]=u;

                 return true;

             }

         }

     }

     return false;

 }

 int hungary(){

     int res=;

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

     for(int u=;u<p;u++){

         memset(vis,false,sizeof(vis));

         res+=dfs(u);

     }

     return res;

 }

 int main(){

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

         for(int i=;i<M;i++)map[i].clear();

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

             cin>>lk[i]>>dislk[i];

         }

         for(int i=;i<p;i++)

           for(int j=i+;j<p;j++)

             if(lk[i]==dislk[j]||dislk[i]==lk[j]){  //产生矛盾的人之间建立无向边

                 map[i].push_back(j);

                 map[j].push_back(i);

             }

         printf("%d\n",p-hungary()/);    //最大独立集=总点数-最大匹配

     }

     return ;

 }