#include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<cstring>

 #include<cstdlib>

 #include<string.h>

 #include<set>

 #include<vector>

 #include<queue>

 #include<stack>

 #include<map>

 #include<cmath>

 typedef long long ll;

 typedef unsigned long long LL;

 using namespace std;

 const double PI=acos(-1.0);

 const double eps=0.0000000001;

 const int INF=0x3f3f3f3f;

 const int N=+;

 int mp[N][N];

 int vis1[N],vis2[N];

 int fun(int x,int m){

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

         if(mp[x][i]&&vis1[i]==){

             vis1[i]=;

             if(vis2[i]==||fun(vis2[i],m)){

                 vis2[i]=x;

                 return ;

             }

         }

     }

     return ;

 }

 int main(){

     int k,m,n;

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

         if(k==)break;

         scanf("%d%d",&n,&m);

         memset(mp,,sizeof(mp));

         memset(vis2,,sizeof(vis2));

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

             int x,y;

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

             mp[x][y]=;

         }

         int ans=;

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

             memset(vis1,,sizeof(vis1));

             if(fun(i,m))ans++;

         }

         cout<<ans<<endl;

     }

 }