#include<cstdio>

 #include<iostream>

 #include<cstring>

 using namespace std;

 int k, n, m;

 int match[], vis[], g[][];

 inline int dfs(int u){

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

         if(g[u][i] && !vis[i]){

             vis[i] = ;

             if(!match[i] || dfs(match[i])){

                 match[i] = u;

                 return ;

             }

         }

     }

     return ;

 }

 inline int hungary(){

     memset(match, , sizeof(match));

     int ans = ;

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

         memset(vis, , sizeof(vis));

         if(dfs(i)) ans++;

     }

     return ans;

 }

 int main(){

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

         memset(g, , sizeof(g));

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

             int a, b;

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

             g[a][b] = ;

         }

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

     }

     return ;

 }