1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 using namespace std;
 5 #define maxn 1010
 6 int n,m,k,head[maxn],tot,link[maxn];
 7 struct Edge{
 8     int to,next;
 9 }e[maxn];
10 bool vis[maxn];
11 void Prepare(){
12     memset(link,0,sizeof(link));
13     memset(e,0,sizeof(e));tot=0;
14     memset(head,0,sizeof(head));
15 }
16 void Add_Edge(int u,int v){
17     e[++tot].to=v;e[tot].next=head[u];
18     head[u]=tot;
19 }
20 bool DFS(int u){
21     for(int i=head[u];i;i=e[i].next){
22         int v=e[i].to;
23         if(!vis[v]){
24             vis[v]=1;
25             if(!link[v] || DFS(link[v])){
26                 link[v]=u;
27                 return true;
28             }
29         }
30     }
31     return false;
32 }
33 int main()
34 {
35     while(scanf("%d %d %d",&k,&m,&n)==3){
36         Prepare();
37         for(int i=1,u,v;i<=k;i++){
38             scanf("%d%d",&u,&v);
39             Add_Edge(u,m+v);
40         }
41         int ans=0;
42         for(int i=1;i<=m;i++){
43             memset(vis,0,sizeof(vis));
44             if(DFS(i))ans++;
45         }
46         printf("%d\n",ans);
47     }
48     return 0;
49 }