#include<cstdio>

 #include<cstring>

 #include<iostream>

 using namespace std;

 struct Edge{

     int to,nxt;

     Edge(int to=,int nxt=):

         to(to),nxt(nxt){}

 };

 const int maxn=,maxm=;

 Edge E[maxm<<];

 int head[maxn],mat[maxn];

 bool check[maxn];

 int n,n_l,n_r,m,cnt=;

 bool dfs(int u){

     for(int e=head[u];e;e=E[e].nxt){

         int v=E[e].to;

         if(!check[v]){

             check[v]=;

             if(mat[v]==-||dfs(mat[v])){

                 mat[v]=u;

                 mat[u]=v;

                 return ;

             }

         }

     }

     return ;

 }

 void hungarian(){

     int ans=;

     memset(mat,-,sizeof mat);

     for(int u=;u<=n_l;u++)

         if(mat[u]==-){

             memset(check,,sizeof check);

             if(dfs(u))  ans++;

         }

     printf("%d\n",ans);

 }

 inline void ad_e(int from=,int to=){

     E[++cnt]=Edge(to,head[from]);

     head[from]=cnt;

     E[++cnt]=Edge(from,head[to]);

     head[to]=cnt;

 }

 void init(){

     scanf("%d%d%d",&n_l,&n_r,&m);

     for(int i=,ff,tt;i<m;i++){

         scanf("%d%d",&ff,&tt);

         if(tt>n_r)  continue;

         ad_e(ff,tt+n_l);

     }

 }

 int main(){

     init();

     hungarian();

     return ;

 }